A recognition algorithm for the total graphs
- 1 June 1978
- Vol. 8 (2) , 121-133
- https://doi.org/10.1002/net.3230080205
Abstract
A graph H is called total if there exists a graph G such that there is a one‐to‐one correspondence between the vertices of H and the vertices and edges of G such that two vertices of H are adjacent iff the corresponding elements of G are adjacent or incident.In this paper we present a linear time algorithm for the recognition of the total graphs. The algorithm is based on the breadth‐first search technique.Keywords
This publication has 4 references indexed in Scilit:
- Algorithmic Aspects of Vertex Elimination on GraphsSIAM Journal on Computing, 1976
- Total graphsPublished by Springer Nature ,1972
- A characterization of total graphsProceedings of the American Mathematical Society, 1970
- The total group of a graphProceedings of the American Mathematical Society, 1968