Graphs with maximum and minimum independence numbers.
Gutman, Ivan (1983)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Gutman, Ivan (1983)
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:
Petrović, Miroslav, Milekić, Bojana (2000)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Allen, Peter, Lozin, Vadim, Rao, Michaël (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Maria Kwaśnik, Danuta Michalak (1989)
Časopis pro pěstování matematiky
Similarity:
Topp, Jerzy, Volkmann, Lutz (1990)
Mathematica Pannonica
Similarity:
Francesco Regonati, N. Zagaglia Salvi (1994)
Czechoslovak Mathematical Journal
Similarity:
A. K. Dewdney, Frank Harary (1976)
Czechoslovak Mathematical Journal
Similarity:
Terry A. McKee (2017)
Discussiones Mathematicae Graph Theory
Similarity:
A graph is defined to be an atom if no minimal vertex separator induces a complete subgraph; thus, atoms are the graphs that are immune to clique separator decomposition. Atoms are characterized here in two ways: first using generalized vertex elimination schemes, and then as generalizations of 2-connected unichord-free graphs (the graphs in which every minimal vertex separator induces an edgeless subgraph).
Vladislav Bína, Jiří Přibil (2015)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
The paper brings explicit formula for enumeration of vertex-labeled split graphs with given number of vertices. The authors derive this formula combinatorially using an auxiliary assertion concerning number of split graphs with given clique number. In conclusion authors discuss enumeration of vertex-labeled bipartite graphs, i.e., a graphical class defined in a similar manner to the class of split graphs.