Some properties of locally homogeneous graphs.
Al-Addasi, Salah (2010)
Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică
Similarity:
Al-Addasi, Salah (2010)
Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică
Similarity:
Karpov, D.V., Pastor, A.V. (2000)
Zapiski Nauchnykh Seminarov POMI
Similarity:
Olivier Baudon, Julien Bensmail, Florent Foucaud, Monika Pilśniak (2017)
Discussiones Mathematicae Graph Theory
Similarity:
A connected graph G is said to be arbitrarily partitionable (AP for short) if for every partition (n1, . . . , np) of |V (G)| there exists a partition (V1, . . . , Vp) of V (G) such that each Vi induces a connected subgraph of G on ni vertices. Some stronger versions of this property were introduced, namely the ones of being online arbitrarily partitionable and recursively arbitrarily partitionable (OL-AP and R-AP for short, respectively), in which the subgraphs induced by a partition...
Ladislav Nebeský (1991)
Czechoslovak Mathematical Journal
Similarity:
Ladislav Nebeský (1985)
Czechoslovak Mathematical Journal
Similarity:
Gabor Bacsó, Zsolt Tuza (2004)
Discussiones Mathematicae Graph Theory
Similarity:
Zverovich [Discuss. Math. Graph Theory 23 (2003), 159-162.] has proved that the domination number and connected domination number are equal on all connected graphs without induced P₅ and C₅. Here we show (with an independent proof) that the following stronger result is also valid: Every P₅-free and C₅-free connected graph contains a minimum-size dominating set that induces a complete subgraph.
Akiyama, Jin, Harary, Frank (1979)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Ľubomír Šoltés (1992)
Mathematica Slovaca
Similarity:
B. Arsić, I. Gutman, K. Ch. Das, K. Xu (2012)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity: