Bounds for the Kirchhoff index of bipartite graphs (Q442815): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
Summary: A \((m, n)\)-bipartite graph is a bipartite graph such that one bipartition has \(m\) vertices and the other bipartition has \(n\) vertices. The tree dumbbell \(D(n, a, b)\) consists of the path \(P_{n-a-b}\) together with \(a\) independent vertices adjacent to one independent vertex of \(P_{n-a-b}\) and \(b\) independent vertices adjacent to the other pendent vertex of \(P_{n-a-b}\). In this paper, firstly, we show that, among \((m, n)\)-bipartite graphs \((m \leq n)\), the complete bipartite graph \(K_{m,n}\) has minimal Kirchhoff index and the tree dumbbell \(D(m + n, \lfloor n - (m + 1)/2\rfloor, \lceil n - (m + 1)/2 \rceil)\) has maximal Kirchhoff index. Then, we show that, among all bipartite graphs of order \(l\), the complete bipartite graph \(K_{\lfloor l/2 \rfloor, l - \lfloor l/2 \rfloor}\) has minimal Kirchhoff index and the path \(P_l\) has maximal Kirchhoff index, respectively. Finally, bonds for the Kirchhoff index of \((m, n)\)-bipartite graphs and bipartite graphs of order \(l\) are obtained by computing the Kirchhoff index of these extremal graphs.
Property / review text: Summary: A \((m, n)\)-bipartite graph is a bipartite graph such that one bipartition has \(m\) vertices and the other bipartition has \(n\) vertices. The tree dumbbell \(D(n, a, b)\) consists of the path \(P_{n-a-b}\) together with \(a\) independent vertices adjacent to one independent vertex of \(P_{n-a-b}\) and \(b\) independent vertices adjacent to the other pendent vertex of \(P_{n-a-b}\). In this paper, firstly, we show that, among \((m, n)\)-bipartite graphs \((m \leq n)\), the complete bipartite graph \(K_{m,n}\) has minimal Kirchhoff index and the tree dumbbell \(D(m + n, \lfloor n - (m + 1)/2\rfloor, \lceil n - (m + 1)/2 \rceil)\) has maximal Kirchhoff index. Then, we show that, among all bipartite graphs of order \(l\), the complete bipartite graph \(K_{\lfloor l/2 \rfloor, l - \lfloor l/2 \rfloor}\) has minimal Kirchhoff index and the path \(P_l\) has maximal Kirchhoff index, respectively. Finally, bonds for the Kirchhoff index of \((m, n)\)-bipartite graphs and bipartite graphs of order \(l\) are obtained by computing the Kirchhoff index of these extremal graphs. / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C12 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6063327 / rank
 
Normal rank
Property / zbMATH Keywords
 
tree dumbbell
Property / zbMATH Keywords: tree dumbbell / rank
 
Normal rank

Revision as of 02:28, 30 June 2023

scientific article
Language Label Description Also known as
English
Bounds for the Kirchhoff index of bipartite graphs
scientific article

    Statements

    Bounds for the Kirchhoff index of bipartite graphs (English)
    0 references
    0 references
    0 references
    6 August 2012
    0 references
    Summary: A \((m, n)\)-bipartite graph is a bipartite graph such that one bipartition has \(m\) vertices and the other bipartition has \(n\) vertices. The tree dumbbell \(D(n, a, b)\) consists of the path \(P_{n-a-b}\) together with \(a\) independent vertices adjacent to one independent vertex of \(P_{n-a-b}\) and \(b\) independent vertices adjacent to the other pendent vertex of \(P_{n-a-b}\). In this paper, firstly, we show that, among \((m, n)\)-bipartite graphs \((m \leq n)\), the complete bipartite graph \(K_{m,n}\) has minimal Kirchhoff index and the tree dumbbell \(D(m + n, \lfloor n - (m + 1)/2\rfloor, \lceil n - (m + 1)/2 \rceil)\) has maximal Kirchhoff index. Then, we show that, among all bipartite graphs of order \(l\), the complete bipartite graph \(K_{\lfloor l/2 \rfloor, l - \lfloor l/2 \rfloor}\) has minimal Kirchhoff index and the path \(P_l\) has maximal Kirchhoff index, respectively. Finally, bonds for the Kirchhoff index of \((m, n)\)-bipartite graphs and bipartite graphs of order \(l\) are obtained by computing the Kirchhoff index of these extremal graphs.
    0 references
    0 references
    0 references
    0 references
    0 references
    tree dumbbell
    0 references