Graphs with prescribed neighbourhood graphs
Bohdan Zelinka (1985)
Mathematica Slovaca
Similarity:
Displaying similar documents to “The bondage number of graphs: good and bad vertices”
Graphs with prescribed neighbourhood graphs
A note on the k-domination number of a graph.
Caro, Y., Roditty, Y. (1990)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Chordal Graphs
Broderick Arneson, Piotr Rudnicki (2006)
Formalized Mathematics
Similarity:
We are formalizing [9, pp. 81-84] where chordal graphs are defined and their basic characterization is given. This formalization is a part of the M.Sc. work of the first author under supervision of the second author.
On the 3-Colouring Vertex Folkman Number F(2,2,4)
Nenov, Nedyalko (2001)
Serdica Mathematical Journal
Similarity:
In this note we prove that F (2, 2, 4) = 13.
On the Extension of Graphs with a Given Diameter without Superfluous Edges
Ferdinand Gliviak, Peter Kyš, Ján Plesník (1969)
Matematický časopis
Similarity: