Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8903470 | Electronic Notes in Discrete Mathematics | 2017 | 7 Pages |
Abstract
The Gallai graph Î(G) of a graph G, has the edges of G as its vertices and two distinct edges are adjacent in Î(G) if they are incident in G, but do not span a triangle. The anti-Gallai graph Î(G) of a graph G, has the edges of G as its vertices and two distinct edges of G are adjacent in Î(G) if they lie on a common triangle in G. In this paper we study graphs G for which Î(G)â
Î(G). We also prove that, there does not exist any graph G for which Î(Î(G))â
Î(Î(G))â
H, where H is diamond-free.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jeepamol J. Palathingal, S. Aparna Lakshmanan,