Tree-Like Partial Hamming Graphs

Tanja Gologranc

Displaying similar documents to “Tree-Like Partial Hamming Graphs”

The number of labelled $k$ -arch graphs.

Lamathe, Cédric (2004)

Journal of Integer Sequences [electronic only]

Similarity:

Distance of Thorny Graphs

Ivan Gutman (1998)

Publications de l'Institut Mathématique

Similarity:

Regular graphs and their spanning trees

Jiří Sedláček (1970)

Časopis pro pěstování matematiky

Similarity:

On $(δ, χ)$ -bounded families of graphs.

Gyárfás, András, Zaker, Manouchehr (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Counting two-graphs related to trees.

Cameron, Peter J. (1995)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Forest decompositions of graphs with cyclomatic number 3.

Farrell, E.J. (1983)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Salem numbers, Pisot numbers, Mahler measure, and graphs.

McKee, James, Smyth, Chris (2005)

Experimental Mathematics

Similarity:

On Unique Minimum Dominating Sets in Some Cartesian Product Graphs

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.

On the Zagreb index of quasi-tree graphs.

Qiao, Sheng Ning (2010)

Applied Mathematics E-Notes [electronic only]

Similarity:

The inertia of unicyclic graphs and bicyclic graphs

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...