| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4647232 | Discrete Mathematics | 2015 | 6 Pages |
Abstract
The Gallai graph Gal(G) of a graph GG has the edges of GG as its vertices, and two distinct vertices ee and ff of Gal(G) are adjacent in Gal(G) if the edges ee and ff of GG are adjacent in GG but do not span a triangle in GG. In the present paper we characterize those graphs whose Gallai graphs are forests or trees, respectively.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Felix Joos, Van Bang Le, Dieter Rautenbach,