Bounds for the Kirchhoff Index of Bipartite Graphs
A -bipartite graph is a bipartite graph such that one bipartition has m vertices and the other bipartition has n vertices. The tree dumbbell consists of the path together with a independent vertices adjacent to one pendent vertex of and b independent vertices adjacent to the other pendent vertex...
Saved in:
Main Author: | Yujun Yang |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2012-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2012/195242 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Upper and Lower Bounds for the Kirchhoff Index of the n-Dimensional Hypercube Network
by: Jia-Bao Liu, et al.
Published: (2020-01-01) -
Algorithmic aspects of bipartite graphs
by: Mihály Bakonyi, et al.
Published: (1995-01-01) -
Longest cycles in certain bipartite graphs
by: Pak-Ken Wong
Published: (1998-01-01) -
New Bounds for the Randić Index of Graphs
by: Maryam Atapour, et al.
Published: (2021-01-01) -
Bipartite Diametrical Graphs of Diameter 4 and Extreme Orders
by: Salah Al-Addasi, et al.
Published: (2008-01-01)