The sum of all distances in bipartite graphs
Ivan Gutman, Yeong Nan Yeh (1995)
Mathematica Slovaca
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Graphs with maximum and minimum independence numbers.”
The sum of all distances in bipartite graphs
A characterization of -closed graphs
Pavol Híc (1989)
Mathematica Slovaca
Similarity:
Maximal Graphs with Given Connectivity and Edge-Connectivity
Ferdinand Gliviak (1975)
Matematický časopis
Similarity:
Gallai and anti-Gallai graphs of a graph
Aparna Lakshmanan S., S. B. Rao, A. Vijayakumar (2007)
Mathematica Bohemica
Similarity:
The paper deals with graph operators—the Gallai graphs and the anti-Gallai graphs. We prove the existence of a finite family of forbidden subgraphs for the Gallai graphs and the anti-Gallai graphs to be -free for any finite graph . The case of complement reducible graphs—cographs is discussed in detail. Some relations between the chromatic number, the radius and the diameter of a graph and its Gallai and anti-Gallai graphs are also obtained.