Independence number and minimum degree for the existence of -critical graphs.
Zhou, Sizhong, Pan, Quanru, Xu, Yang (2011)
Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică
Similarity:
Zhou, Sizhong, Pan, Quanru, Xu, Yang (2011)
Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică
Similarity:
Pedersen, Anders Sune (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Sudhir R. Jog, Satish P. Hande, Ivan Gutman, S. Burcu Bozkurt (2012)
Kragujevac Journal of Mathematics
Similarity:
Fronček, D. (2000)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
B. Zhou, I. Gutman (2007)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
John J. Lattanzio, Quan Zheng (2012)
Discussiones Mathematicae Graph Theory
Similarity:
For natural numbers k and n, where 2 ≤ k ≤ n, the vertices of a graph are labeled using the elements of the k-fold Cartesian product Iₙ × Iₙ × ... × Iₙ. Two particular graph constructions will be given and the graphs so constructed are called generalized matrix graphs. Properties of generalized matrix graphs are determined and their application to completely independent critical cliques is investigated. It is shown that there exists a vertex critical graph which admits a family of k...
Singaraj K. Ayyaswamy, Selvaraj Balachandran, Ivan Gutman (2010)
Kragujevac Journal of Mathematics
Similarity:
Harishchandra S. Ramane, Ivan Gutman, Hanumappa B. Walikar, Sabeena B. Halkarni (2004)
Kragujevac Journal of Mathematics
Similarity:
N. R. Santhi Maheswari, C. Sekar (2012)
Kragujevac Journal of Mathematics
Similarity:
Chen, Guantao, Egawa, Yoshimi, Kawarabayashi, Ken-ichi, Mohar, Bojan, Ota, Katsuhiro (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Saoud, Mahmoud, Al-Khanaifes, Kaled (2009)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Teresa Haynes, Michael Henning (2012)
Open Mathematics
Similarity:
A graph G is diameter-2-critical if its diameter is two and the deletion of any edge increases the diameter. In this paper we characterize the diameter-2-critical graphs with no antihole of length four, that is, the diameter-2-critical graphs whose complements have no induced 4-cycle. Murty and Simon conjectured that the number of edges in a diameter-2-critical graph of order n is at most n 2/4 and that the extremal graphs are complete bipartite graphs with equal size partite sets. As...
Cvetković, D., Lepović, M. (2004)
Bulletin. Classe des Sciences Mathématiques et Naturelles. Sciences Mathématiques
Similarity: