On the -Splitting Graph of a Graph
N. R. Santhi Maheswari, C. Sekar (2012)
Kragujevac Journal of Mathematics
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A Note on the Seven Bridges of Königsberg Problem”
On the -Splitting Graph of a Graph
Complete and almost complete minors in double-critical 8-chromatic graphs.
Pedersen, Anders Sune (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A not on dominating set with Maple.
Matinfar, M., Mirzamani, S. (2008)
The Journal of Nonlinear Sciences and its Applications
Similarity:
Sharp bounds for the sum of the squares of the degrees of a graph
Kinkar Ch. Das (2003)
Kragujevac Journal of Mathematics
Similarity:
Toughness of -minor-free graphs.
Chen, Guantao, Egawa, Yoshimi, Kawarabayashi, Ken-ichi, Mohar, Bojan, Ota, Katsuhiro (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:
The neighborhood complex of an infinite graph.
Arenas, F.G., Puertas, M.L. (2000)
Divulgaciones Matemáticas
Similarity:
Cyclic connectivity classes of directed graphs.
Hetyei, Gábor (2001)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
Another class of equienergetic graphs
Harishchandra S. Ramane, Ivan Gutman, Hanumappa B. Walikar, Sabeena B. Halkarni (2004)
Kragujevac Journal of Mathematics
Similarity:
Graph minors and minimum degree.
Fijavž, Gašper, Wood, David R. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Derived graphs of some graphs
Sudhir R. Jog, Satish P. Hande, Ivan Gutman, S. Burcu Bozkurt (2012)
Kragujevac Journal of Mathematics
Similarity:
A note on upper bound for chromatic number of a graph.
Stacho, L. (2002)
Acta Mathematica Universitatis Comenianae. New Series
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].
Signed total distance -domatic numbers of graphs
S. M. Sheikholeslami, L. Volkmann (2013)
Matematički Vesnik
Similarity: