The dynamics of the forest graph operator
From MaRDI portal
Publication:339482
DOI10.7151/dmgt.1901zbMath1350.05144arXiv1601.01041OpenAlexW2963566758MaRDI QIDQ339482
Thomas Zaslavsky, S. M. Hegde, Venkateshwarlu Deva, Suresh Dara, Siddani Bhaskara Rao
Publication date: 11 November 2016
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.01041
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An upper bound for the number of spanning trees of a graph
- The number of spanning forests of a graph
- A sharp upper bound for the number of spanning trees of a graph
- Sharp upper bounds for the number of spanning trees of a graph
- On connectivities of tree graphs
- 2-Isomorphic Graphs
- The number of spanning trees of a graph with given matching number
- The number of spanning trees of a graph
- The number of spanning trees of a graph