Resistance characterizations of equiarboreal graphs

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

9 Scopus Citations
View graph of relations

Author(s)

  • Jiang Zhou
  • Lizhu Sun
  • Changjiang Bu

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)2864-2870
Journal / PublicationDiscrete Mathematics
Volume340
Issue number12
Online published24 Aug 2017
Publication statusPublished - Dec 2017

Abstract

A weighted (unweighted) graph G is called equiarboreal if the sum of weights (the number) of spanning trees containing a given edge in G is independent of the choice of edge. In this paper, we give some resistance characterizations of equiarboreal weighted and unweighted graphs, and obtain the necessary and sufficient conditions for k-subdivision graphs, iterated double graphs, line graphs of regular graphs and duals of planar graphs to be equiarboreal. Applying these results, we obtain new infinite families of equiarboreal graphs, including iterated double graphs of 1-walk-regular graphs, line graphs of triangle-free 2-walk-regular graphs, and duals of equiarboreal planar graphs.

Research Area(s)

  • Equiarboreal graph, Laplacian matrix, Resistance distance, Spanning tree

Citation Format(s)

Resistance characterizations of equiarboreal graphs. / Zhou, Jiang; Sun, Lizhu; Bu, Changjiang.

In: Discrete Mathematics, Vol. 340, No. 12, 12.2017, p. 2864-2870.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review