On the -Splitting Graph of a Graph
N. R. Santhi Maheswari, C. Sekar (2012)
Kragujevac Journal of Mathematics
Similarity:
Displaying similar documents to “A not on dominating set with Maple.”
On the -Splitting Graph of a Graph
Sharp bounds for the sum of the squares of the degrees of a graph
Kinkar Ch. Das (2003)
Kragujevac Journal of Mathematics
Similarity:
Simple Graphs as Simplicial Complexes: the Mycielskian of a Graph
Piotr Rudnicki, Lorna Stewart (2012)
Formalized Mathematics
Similarity:
Harary [10, p. 7] claims that Veblen [20, p. 2] first suggested to formalize simple graphs using simplicial complexes. We have developed basic terminology for simple graphs as at most 1-dimensional complexes. We formalize this new setting and then reprove Mycielski’s [12] construction resulting in a triangle-free graph with arbitrarily large chromatic number. A different formalization of similar material is in [15].
Complete and almost complete minors in double-critical 8-chromatic graphs.
Pedersen, Anders Sune (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Calculating the number of the linear factors in planar graphs.
Saoud, Mahmoud, Al-Khanaifes, Kaled (2009)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Derived graphs of some graphs
Sudhir R. Jog, Satish P. Hande, Ivan Gutman, S. Burcu Bozkurt (2012)
Kragujevac Journal of Mathematics
Similarity:
On second-stage spectrum and energy of a graph
Singaraj K. Ayyaswamy, Selvaraj Balachandran, Ivan Gutman (2010)
Kragujevac Journal of Mathematics
Similarity:
Cyclic connectivity classes of directed graphs.
Hetyei, Gábor (2001)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
The neighborhood complex of an infinite graph.
Arenas, F.G., Puertas, M.L. (2000)
Divulgaciones Matemáticas
Similarity:
Note on seed graphs with components of given order.
Fronček, D. (2000)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Expected lengths of minimum spanning trees for non-identical edge distributions.
Li, Wenbo V., Zhang, Xinyi (2010)
Electronic Journal of Probability [electronic only]
Similarity:
Characterization of finite groups by their commuting graph.
Iranmanesh, A., Jafarzadeh, A. (2007)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
The complexity of obtaining a distance-balanced graph.
Cabello, Sergio, Lukšič, Primož (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Signed total distance -domatic numbers of graphs
S. M. Sheikholeslami, L. Volkmann (2013)
Matematički Vesnik
Similarity: