IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v315y2017icp313-318.html
   My bibliography  Save this article

On the minimum Kirchhoff index of graphs with a given vertex k-partiteness and edge k-partiteness

Author

Listed:
  • He, Weihua
  • Li, Hao
  • Xiao, Shuofa

Abstract

The Kirchhoff index of a connected graph is the sum of the resistance distance between all unordered pairs of vertices and may also be expressed by its Laplacian eigenvalues. The vertex (resp. edge) k-partiteness of a graph G with n vertices is the minimum number of vertices (resp. edges) whose deletion from G yields a k-partite graph. In this paper, we determine the minimum Kirchhoff index of graphs with a given vertex k-partiteness and the minimum Kirchhoff index of graphs with a given edge bipartiteness, when the given edge bipartiteness is no more than n4.

Suggested Citation

  • He, Weihua & Li, Hao & Xiao, Shuofa, 2017. "On the minimum Kirchhoff index of graphs with a given vertex k-partiteness and edge k-partiteness," Applied Mathematics and Computation, Elsevier, vol. 315(C), pages 313-318.
    • Handle: RePEc:eee:apmaco:v:315:y:2017:i:c:p:313-318
    DOI: 10.1016/j.amc.2017.07.067
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300317305283
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2017.07.067?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Huang, Jing & Li, Shuchao & Li, Xuechao, 2016. "The normalized Laplacian, degree-Kirchhoff index and spanning trees of the linear polyomino chains," Applied Mathematics and Computation, Elsevier, vol. 289(C), pages 324-334.
    2. José Luis Palacios, 2004. "Foster's Formulas via Probability and the Kirchhoff Index," Methodology and Computing in Applied Probability, Springer, vol. 6(4), pages 381-387, December.
    3. Qi, Xuli & Zhou, Bo & Du, Zhibin, 2016. "The Kirchhoff indices and the matching numbers of unicyclic graphs," Applied Mathematics and Computation, Elsevier, vol. 289(C), pages 464-480.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yang, Yujun & Cao, Yuliang & Yao, Haiyuan & Li, Jing, 2018. "Solution to a conjecture on a Nordhaus–Gaddum type result for the Kirchhoff index," Applied Mathematics and Computation, Elsevier, vol. 332(C), pages 241-249.
    2. Huang, Guixian & He, Weihua & Tan, Yuanyao, 2019. "Theoretical and computational methods to minimize Kirchhoff index of graphs with a given edge k-partiteness," Applied Mathematics and Computation, Elsevier, vol. 341(C), pages 348-357.
    3. Shuchao Li & Licheng Zhang & Minjie Zhang, 2019. "On the extremal cacti of given parameters with respect to the difference of zagreb indices," Journal of Combinatorial Optimization, Springer, vol. 38(2), pages 421-442, August.
    4. Fei, Junqi & Tu, Jianhua, 2018. "Complete characterization of bicyclic graphs with the maximum and second-maximum degree Kirchhoff index," Applied Mathematics and Computation, Elsevier, vol. 330(C), pages 118-124.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Huang, Guixian & He, Weihua & Tan, Yuanyao, 2019. "Theoretical and computational methods to minimize Kirchhoff index of graphs with a given edge k-partiteness," Applied Mathematics and Computation, Elsevier, vol. 341(C), pages 348-357.
    2. Fei, Junqi & Tu, Jianhua, 2018. "Complete characterization of bicyclic graphs with the maximum and second-maximum degree Kirchhoff index," Applied Mathematics and Computation, Elsevier, vol. 330(C), pages 118-124.
    3. Liu, Jia-Bao & Zhao, Jing & Cai, Zheng-Qun, 2020. "On the generalized adjacency, Laplacian and signless Laplacian spectra of the weighted edge corona networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 540(C).
    4. Ma, Xiaoling & Bian, Hong, 2019. "The normalized Laplacians, degree-Kirchhoff index and the spanning trees of hexagonal Möbius graphs," Applied Mathematics and Computation, Elsevier, vol. 355(C), pages 33-46.
    5. Li, Zhemin & Xie, Zheng & Li, Jianping & Pan, Yingui, 2020. "Resistance distance-based graph invariants and spanning trees of graphs derived from the strong prism of a star," Applied Mathematics and Computation, Elsevier, vol. 382(C).
    6. Li, Deqiong & Hou, Yaoping, 2017. "The normalized Laplacian spectrum of quadrilateral graphs and its applications," Applied Mathematics and Computation, Elsevier, vol. 297(C), pages 180-188.
    7. Huang, Jing & Li, Shuchao, 2018. "The normalized Laplacians on both k-triangle graph and k-quadrilateral graph with their applications," Applied Mathematics and Computation, Elsevier, vol. 320(C), pages 213-225.
    8. Li, Danyi & Yan, Weigen, 2023. "Counting spanning trees with a Kekulé structure in linear hexagonal chains," Applied Mathematics and Computation, Elsevier, vol. 456(C).
    9. Cui, Qing & Zhong, Lingping, 2017. "The general Randić index of trees with given number of pendent vertices," Applied Mathematics and Computation, Elsevier, vol. 302(C), pages 111-121.
    10. Hong, Yunchao & Zhu, Zhongxun & Luo, Amu, 2018. "Some transformations on multiplicative eccentricity resistance-distance and their applications," Applied Mathematics and Computation, Elsevier, vol. 323(C), pages 75-85.
    11. Yasir Ahmad & Umar Ali & Daniele Ettore Otera & Xiang-Feng Pan, 2024. "Study of Random Walk Invariants for Spiro-Ring Network Based on Laplacian Matrices," Mathematics, MDPI, vol. 12(9), pages 1-19, April.
    12. Yang, Yujun & Cao, Yuliang & Yao, Haiyuan & Li, Jing, 2018. "Solution to a conjecture on a Nordhaus–Gaddum type result for the Kirchhoff index," Applied Mathematics and Computation, Elsevier, vol. 332(C), pages 241-249.
    13. Jia-Bao Liu & Jing Zhao & Zhongxun Zhu & Jinde Cao, 2019. "On the Normalized Laplacian and the Number of Spanning Trees of Linear Heptagonal Networks," Mathematics, MDPI, vol. 7(4), pages 1-15, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:315:y:2017:i:c:p:313-318. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.