云南高校图书馆联盟文献共享服务平台- MULTIGRAPHS

检索规则说明：AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：范例一： (K=图书馆学 OR K=情报学) AND A=范并思　　　　范例二：J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual

全部期刊核心期刊 EI来源期刊 SCI来源期刊 CA来源期刊 CSCD来源期刊 CSSCI来源期刊

Algebraic Characterization of SSC of Uni-Cyclic Multigraphs: 《Algebra Colloquium》2023年第2期325-338,共14页Imran Ahmed Shahid Muhmood; We introduce first the spanning simplicial complex(SSC)of a multigraph g,which gives a generalization of the SSC associated with a simple graph G.Combinatorial properties are discussed for the SSC of a family of uni-c...; 关键词：simplicial complexes spanning trees Hilbert series vertex covers Betti numbers

Star-factorization of the Complete Bipartite Multigraphs: 《Acta Mathematicae Applicatae Sinica》2023年第2期239-248,共10页Jing SHI Jian WANG Bei-liang DU; supported by the National Natural Science Foundation of China (Grant No.K110703711)。; LetλK_(m,n)be a complete bipartite multigraph with two partite sets having m and n vertices,respectively.A K_(p,q)-factorization ofλK_(m,n)is a set of K_(p,q)-factors ofλK_(m,n)which partition the set of edges ofλ...; 关键词：complete bipartite multigraph STAR FACTORIZATION

{Ck, Pk, Sk} -Decompositions of Balanced Complete Bipartite Multigraphs: 《Open Journal of Discrete Mathematics》2016年第3期174-179,共7页Jenq-Jong Lin Min-Jen Jou; Let be a family of subgraphs of a graph G. An L-decomposition of G is an edge-disjoint decomposition of G into positive integer copies of H_i, where . Let C_k, P_k and S_k denot...; 关键词：Balanced Complete Bipartite Multigraph Cycle Path Star Decomposition

THE MAXIMUM AND MINIMUM DEGREES OF RANDOM BIPARTITE MULTIGRAPHS被引量：1: 《Acta Mathematica Scientia》2011年第3期1155-1166,共12页陈爱莲张福基李皓; supported by NSFC (10671162;10831001;10871046); In this paper the authors generalize the classic random bipartite graph model, and define a model of the random bipartite multigraphs as follows：let m = m（n） be a positive integer-valued function on n and ζ（n,m;{...; 关键词：maximum degree minimum degree degree distribution random bipartite multigraphs

On f-edge Cover Chromatic Index of Multigraphs: 《Communications in Mathematical Research》2009年第5期429-432,共4页JIA YAN-BIN Xu CHANG-QING; The HENSF(A2007000002);NSF(10871058)of China; Let G be a multigraph with vertex set V（G）. Assume that a positive integer f（v） with 1 ≤ f（v） ≤ d（v） is associated with each vertex v ∈ V. An edge coloring of G is called an f-edge cover-coloring, if each c...; 关键词：edge coloring f-edge cover-coloring f-edge cover

On K_(1,k)-factorization of bipartite multigraphs: 《Applied Mathematics(A Journal of Chinese Universities)》2008年第3期345-350,共6页WANG Jian; the National Natural Science Foundation of China (10571133); A K1,k-factorization of λKm,n is a set of edge-disjoint K1,k-factors of λKm,n, which partition the set of edges of λKm,n. In this paper, it is proved that a sufficient condition for the existence of K1,k-factorizat...; 关键词：FACTOR FACTORIZATION bipartite multigraph

The spectrum of path factorization of bipartite multigraphs: 《Science China Mathematics》2007年第7期1045-1054,共10页Jian WANG~1 Bei-liang DU~(2+) 1 Nantong Vocational College,Nantong 226007,China 2 Department of Mathematics,Suzhou University,Suzhou 215006,China; This work was supported by the National Natural Science Foundation of China(Grant No.10571133).; Let λK m,n be a bipartite multigraph with two partite sets having m and n vertices, respectively. A P v-factorization of λK m,n is a set of edge-disjoint P v-factors of λK m,n which partition the set of edges of λ...; 关键词：bipartite multigraph FACTORIZATION 05B30 05C70

Partitioning series-parallel multigraphs into υ*-excluding edge covers: 《Science China Mathematics》2006年第8期1082-1093,共12页LIU Guizhen, DENG Xiaotie & XU Changqing School of Mathematics and System Science, Shandong University, Jinan 250100, China Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong, China Department of Applied Mathematics, Hebei University of Technology, Tianjin 300130, China; This work was partially supported by the National Natural Science Foundation of China(Grant No.10471078);the Special Research Foundation for the Doctoral Program of Higher Education of China(Grant No.20040422004);Hong Kong Research Grants Council(Grant No.CityU 1056/01E).; We prove that, for any given vertexν* in a series-parallel graph G, its edge set can be partitioned into k= min{k′(G) + 1,δ(G)} subsets such that each subset covers all the vertices of G possibly except forν*, wh...; 关键词：SERIES-PARALLEL graph edge-connectivity EDGE cover coloring MIN-MAX theorem.

P_(4k-1)-factorization of bipartite multigraphs被引量：1: 《Science China Mathematics》2006年第7期961-970,共10页WANG Jian & DU Beiliang Nantong Vocational College, Nantong 226007, China Department of Mathematics, Suzhou University, Suzhou 215006, China; This work was supported by the National Natural Science Foundation of China (Grant No. 10571133).; LetλKm,n be a bipartite multigraph with two partite sets having m and n vertices, respectively. A Pν-factorization ofλKm,n is a set of edge-disjoint Pν-factors ofλKm,n which partition the set of edges ofλKm,n. W...; 关键词：BIPARTITE multigraph factor factorization.

LOWER BOUNDS ON THE MAXIMUM GENUS OF LOOPLESS MULTIGRAPHS被引量：1: 《Applied Mathematics(A Journal of Chinese Universities)》2000年第4期359-368,共10页LiDeming LiuYanpei; The lower bounds on the maximum genus of loopless graphs are obtained according to the connectivity of these graphs. This not only answers a question of Chen, Archdeacon and Gross, but also generalizes the previous kn...; 关键词：Maximum genus lower bound multigraph.

MULTIGRAPHS