On a quasiordering of bipartite graphs.
Gutman, Ivan, Fuji, Zhang (1986)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Displaying similar documents to “A remark on self-centroidal graphs”
On a quasiordering of bipartite graphs.
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.
The sum of all distances in bipartite graphs
Ivan Gutman, Yeong Nan Yeh (1995)
Mathematica Slovaca
Similarity:
An efficient -centroid location algorithm for cographs.
Prakash, V. (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Randomly complete -partite graphs
Yousef Alavi, Don R. Lick, Song Lin Tian (1989)
Mathematica Slovaca
Similarity:
On the chromatic uniqueness of edge-gluing of complete tripartite graphs and cycles.
Chia, Gek Ling, Ho, Chee-Kit (2003)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity: