1) non-bipartite graph 非二部图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 ...
Let G be a regular graph of degree k( kges3) and girth 4. G is k-admissible if G is not bipartite. G is ( k,2)-admissible if G is k-admissible and the diameter of G is 2. f( k) is defined to be the smallest integer for which there exists a k-admissible graph with ...
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...
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 ...
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:...
A non-formalization description model based on the bipartite graph was established to express the key factors and the matching relationship between the parts. The model could also make individual changes easily. According to proportion of the parts' quantity, the selective assembly could be divided ...
摘要: 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......
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 AX or AY. Otherwise, A is nontrivial. By α(X,Y) we denote the maximum size of nontrivial independent sets of G(X,Y). We prove that if the au...
The Gallai-Edmonds decomposition parti-tions an arbitrary graph into three parts, that is, the so-called D(G), A(G), andC(G) parts. Comparably recently, a new canonical decomposition was proposed:the basilica decomposition [7, 8]. This decomposition is applicable for arbitrarygraphs and ...
Abstract A graph is integral if the spectrum (of its adjacency matrix) consists entirely of integers. In this paper we give a partial answer to the question posed in the title.Previous article in issue Next article in issue Keywords Graph spectrum Integral graphs Graph moments...