Hereditary subdirectly irreducible graphs
Vinárek, Jiří
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Vinárek, Jiří
Similarity:
Petrović, Miroslav (1991)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
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.
G. Abay-Asmerom, R. Hammack, C.E. Larson, D.T. Taylor (2011)
Discussiones Mathematicae Graph Theory
Similarity:
Every connected graph G with radius r(G) and independence number α(G) obeys α(G) ≥ r(G). Recently the graphs for which equality holds have been classified. Here we investigate the members of this class that are Cartesian products. We show that for non-trivial graphs G and H, α(G ☐ H) = r(G ☐ H) if and only if one factor is a complete graph on two vertices, and the other is a nontrivial complete graph. We also prove a new (polynomial computable) lower bound α(G ☐ H) ≥ 2r(G)r(H)...
A. K. Dewdney, Frank Harary (1976)
Czechoslovak Mathematical Journal
Similarity: