2) bipartite graph 二部图 1. Application of the bipartite graph to the design of arranging-lessons system; 二部图在排课系统设计中的应用 2. Vertex-disjoint 4-cycle in a bipartite graph; 二部图中含指定顶点的独立4-圈 3. f-2-covered and f-2-deleted of bipartite graphs; 二部图的f...
A graph G has the repeated degree property if there is an integer n such that for each graph H with at least n vertices, either H or its complement contains a copy of G in which two vertices have the same degree in H. The minimum such number n is the repeated degree number of G....
A graph G is Hamiltonian-connected if, for any two of its vertices, it contains a spanning path joining the two vertices. In this paper, we discuss k-extendable nonbipartite graphs with κ(G)≥2k+r where k≥1 and r≥0. It is shown that if ν≤6k+2r, then G is Hamiltonian; and...
文章通过对传统三义的探析,论证罔两尚有“恍惚”之义,《楚辞》“罔两”即同于“恍惚”;而四义之间看似无关,实则皆源于此词的字面解释——“非二”。3) Asynchronous non-binary 非二进制4) non-binaries 非二元性5) nonbinary code 非二元码6) non-bipartite graph 非二部图参考...
Liu, The (revised) Szeged index and the Wiener index of a non-bipartite graph, ... 赵丽芳 - 《华中师范大学》 被引量: 0发表: 2016年 On the difference between the Szeged and Wiener index We prove a conjecture of Nadjafi-Arani, Khodashenas and Ashrafi on the\ndifference between the ...
Google Share on Facebook natural number (redirected fromNon-negative integer) Thesaurus Encyclopedia Related to Non-negative integer:Whole numbers natural number n. One of the set of positive whole numbers; a positive integer. American Heritage® Dictionary of the English Language, Fifth Edition. ...
摘要: Let G(X,Y) be a connected, non-complete bipartite graph with |X|=<|Y|. An independent set A of G(X,Y) is said to be trivial if A@__ __X or A@__ __Y. Otherwise, A is nontrivial. By @a(X,Y) we denote......
1) non-even graph 非偶图 2) bipartite graph 偶图 1. Uniqueness of cycle length distribution ofbipartite graphs; 偶图K_(n,n)-A(|A|=6)圈长分布的唯一性 更多例句>> 3) bigraph['baiɡrɑ:f] 偶图 1. Taking the supplying regions as rows of thebigraph, the optimum scheme for looped...
A graph is integral if the spectrum (of its adjacency matrix) consists entirely of integers. The problem of determining all non-regular bipartite integral graphs with maximum degree four which do not have ±1 as eigenvalues was posed in K.T. Baliéska, S.K. Simić, K.T. Zwierzyński:...
The Dulmage-Mendelsohn decomposition is a classical canonicaldecomposition in matching theory applicable for bipartite graphs, and is fa-mous not only for its application in the f i eld of matrix computation, but alsofor providing a prototypal structure in matroidal optimization theory. TheDulmage-...