The number of labelled -arch graphs.
Lamathe, Cédric (2004)
Journal of Integer Sequences [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Lamathe, Cédric (2004)
Journal of Integer Sequences [electronic only]
Similarity:
Ivan Gutman (1998)
Publications de l'Institut Mathématique
Similarity:
Jiří Sedláček (1970)
Časopis pro pěstování matematiky
Similarity:
Gyárfás, András, Zaker, Manouchehr (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Cameron, Peter J. (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Farrell, E.J. (1983)
International Journal of Mathematics and Mathematical Sciences
Similarity:
McKee, James, Smyth, Chris (2005)
Experimental Mathematics
Similarity:
Jason T. Hedetniemi (2015)
Discussiones Mathematicae Graph Theory
Similarity:
Unique minimum vertex dominating sets in the Cartesian product of a graph with a complete graph are considered. We first give properties of such sets when they exist. We then show that when the first factor of the product is a tree, consideration of the tree alone is sufficient to determine if the product has a unique minimum dominating set.
Qiao, Sheng Ning (2010)
Applied Mathematics E-Notes [electronic only]
Similarity:
Ying Liu (2013)
Discussiones Mathematicae - General Algebra and Applications
Similarity:
Let G be a graph with n vertices and ν(G) be the matching number of G. The inertia of a graph G, In(G) = (n₊,n₋,n₀) is an integer triple specifying the numbers of positive, negative and zero eigenvalues of the adjacency matrix A(G), respectively. Let η(G) = n₀ denote the nullity of G (the multiplicity of the eigenvalue zero of G). It is well known that if G is a tree, then η(G) = n - 2ν(G). Guo et al. [Ji-Ming Guo, Weigen Yan and Yeong-Nan Yeh. On the nullity and the matching number...