On -closed graphs
Pavel Tomasta, Eliška Tomová (1988)
Czechoslovak Mathematical Journal
Similarity:
Pavel Tomasta, Eliška Tomová (1988)
Czechoslovak Mathematical Journal
Similarity:
Petrović, Miroslav, Milekić, Bojana (2000)
Publications de l'Institut Mathématique. Nouvelle Série
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...
Gliviak, Ferdinand, Kyš, P. (1997)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Ľubomír Šoltés (1992)
Mathematica Slovaca
Similarity:
P K. Jha, G Slutzki (1991)
Applicationes Mathematicae
Similarity:
M. Tavakoli, F. Rahbarnia, A. R. Ashrafi (2013)
Kragujevac Journal of Mathematics
Similarity:
Gurusamy Rengasamy Vijayakumar (2013)
Discussiones Mathematicae Graph Theory
Similarity:
The infimum of the least eigenvalues of all finite induced subgraphs of an infinite graph is defined to be its least eigenvalue. In [P.J. Cameron, J.M. Goethals, J.J. Seidel and E.E. Shult, Line graphs, root systems, and elliptic geometry, J. Algebra 43 (1976) 305-327], the class of all finite graphs whose least eigenvalues ≥ −2 has been classified: (1) If a (finite) graph is connected and its least eigenvalue is at least −2, then either it is a generalized line graph or it is represented...
Petrović, Miroslav (1991)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Bodlaender, Hans L., Kloks, Ton, Kratsch, Dieter, Müller, Haiko (1998)
Journal of Graph Algorithms and Applications
Similarity:
Dragoš Cvetković, Mirko Lepović (2005)
Publications de l'Institut Mathématique
Similarity: