On independent vertices and edges of belt graphs.
Gutman, I. (1996)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Displaying similar documents to “-Invariant tensors and graphs”
On independent vertices and edges of belt graphs.
On a certain distance between isomorphism classes of graphs
Bohdan Zelinka (1975)
Časopis pro pěstování matematiky
Similarity:
The adjacency graphs of a complex
A. K. Dewdney, Frank Harary (1976)
Czechoslovak Mathematical Journal
Similarity:
Sierpiński graphs as spanning subgraphs of Hanoi graphs
Andreas Hinz, Sandi Klavžar, Sara Zemljič (2013)
Open Mathematics
Similarity:
Hanoi graphs H pn model the Tower of Hanoi game with p pegs and n discs. Sierpinski graphs S pn arose in investigations of universal topological spaces and have meanwhile been studied extensively. It is proved that S pn embeds as a spanning subgraph into H pn if and only if p is odd or, trivially, if n = 1.
Gallai and anti-Gallai graphs of a graph
S. Aparna Lakshmanan, S. B. Rao, A. Vijayakumar (2007)
Mathematica Bohemica
Similarity:
The paper deals with graph operators—the Gallai graphs and the anti-Gallai graphs. We prove the existence of a finite family of forbidden subgraphs for the Gallai graphs and the anti-Gallai graphs to be -free for any finite graph . The case of complement reducible graphs—cographs is discussed in detail. Some relations between the chromatic number, the radius and the diameter of a graph and its Gallai and anti-Gallai graphs are also obtained.
On -closed graphs
Pavel Tomasta, Eliška Tomová (1988)
Czechoslovak Mathematical Journal
Similarity: