Gallai and anti-Gallai Graph Operators
| Autor: | S. Aparna Lakshmanan, Jeepamol J. Palathingal |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Combinatorics
010201 computation theory & mathematics Applied Mathematics 0202 electrical engineering electronic engineering information engineering Discrete Mathematics and Combinatorics 020206 networking & telecommunications 0102 computer and information sciences 02 engineering and technology 01 natural sciences Graph Mathematics |
| Zdroj: | Electronic Notes in Discrete Mathematics. 63:447-453 |
| ISSN: | 1571-0653 |
| DOI: | 10.1016/j.endm.2017.11.042 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect