The Dynamics of the Forest Graph Operator
In 1966, Cummins introduced the “tree graph”: the tree graph T(G) of a graph G (possibly infinite) has all its spanning trees as vertices, and distinct such trees correspond to adjacent vertices if they differ in just one edge, i.e., two spanning trees T1 and T2 are adjacent if T2 = T1 − e + f for s...
Main Authors: | Dara Suresh, Hegde S.M., Deva Venkateshwarlu, Rao S.B., Zaslavsky Thomas |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2016-11-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1901 |
Similar Items
-
The irregularity of graphs under graph operations
by: Abdo Hosam, et al.
Published: (2014-05-01) -
Coloring Dynamic Graphs With a Similarity and Pool-Based Evolutionary Algorithm
by: Gizem Sungu Terci, et al.
Published: (2025-01-01) -
On r-dynamic coloring of some graph operations
by: Ika Hesti Agustin, et al.
Published: (2016-10-01) -
Chromatic Number of Fuzzy Graphs: Operations, Fuzzy Graph Coloring, and Applications
by: Zengtai Gong, et al.
Published: (2022-12-01) -
Operations on Soft Graphs
by: Muhammad Akram, et al.
Published: (2015-12-01)