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

Minimizing Kirchhoff index among graphs with a given vertex bipartiteness

Author

Listed:
  • Liu, Jia-Bao
  • Pan, Xiang-Feng

Abstract

The resistance distance between any two vertices of a graph G is defined as the effective resistance between them if each edge of G is replaced by a unit resistor. The Kirchhoff index Kf(G) is the sum of the resistance distances between all the pairs of vertices in G. The vertex bipartiteness vb of a graph G is the minimum number of vertices whose deletion from G results in a bipartite graph. In this paper, we characterize the graph having the minimum Kf(G) values among graphs with a fixed number n of vertices and fixed vertex bipartiteness, 1≤vb≤n−3.

Suggested Citation

  • Liu, Jia-Bao & Pan, Xiang-Feng, 2016. "Minimizing Kirchhoff index among graphs with a given vertex bipartiteness," Applied Mathematics and Computation, Elsevier, vol. 291(C), pages 84-88.
  • Handle: RePEc:eee:apmaco:v:291:y:2016:i:c:p:84-88
    DOI: 10.1016/j.amc.2016.06.017
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300316303885
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2016.06.017?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. Liu, Jia-Bao & Pan, Xiang-Feng, 2015. "Asymptotic incidence energy of lattices," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 422(C), pages 193-202.
    2. Liu, Jia-Bao & Pan, Xiang-Feng, 2015. "A unified approach to the asymptotic topological indices of various lattices," Applied Mathematics and Computation, Elsevier, vol. 270(C), pages 62-73.
    3. Liu, Jia-Bao & Pan, Xiang-Feng & Hu, Fu-Tao & Hu, Feng-Feng, 2015. "Asymptotic Laplacian-energy-like invariant of lattices," Applied Mathematics and Computation, Elsevier, vol. 253(C), pages 205-214.
    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. Sajjad, Wasim & Sardar, Muhammad Shoaib & Pan, Xiang-Feng, 2024. "Computation of resistance distance and Kirchhoff index of chain of triangular bipyramid hexahedron," Applied Mathematics and Computation, Elsevier, vol. 461(C).
    2. 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).
    3. Jian Lu & Shu-Bo Chen & Jia-Bao Liu & Xiang-Feng Pan & Ying-Jie Ji, 2019. "Further Results on the Resistance-Harary Index of Unicyclic Graphs," Mathematics, MDPI, vol. 7(2), pages 1-13, February.
    4. Praba, B. & Saranya, R., 2020. "Application of the graph cellular automaton in generating languages," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 168(C), pages 111-121.
    5. Sardar, Muhammad Shoaib & Pan, Xiang-Feng & Xu, Si-Ao, 2020. "Computation of resistance distance and Kirchhoff index of the two classes of silicate networks," Applied Mathematics and Computation, Elsevier, vol. 381(C).
    6. Wang, Daohua & Zeng, Cheng & Zhao, Zixuan & Wu, Zhiqiang & Xue, Yumei, 2023. "Kirchhoff index of a class of polygon networks," Chaos, Solitons & Fractals, Elsevier, vol. 168(C).
    7. Fang Gao & Xiaoxin Li & Kai Zhou & Jia-Bao Liu, 2018. "The Extremal Graphs of Some Topological Indices with Given Vertex k -Partiteness," Mathematics, MDPI, vol. 6(11), pages 1-11, November.
    8. Jia Wei & Jing Wang, 2022. "Spectra of Complemented Triangulation Graphs," Mathematics, MDPI, vol. 10(17), pages 1-9, September.
    9. 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.
    10. Wenyu Shi & Qiang Tang, 2023. "Cost-optimized data placement strategy for social network with security awareness in edge-cloud computing environment," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-15, January.
    11. Jia-Bao Liu & S. N. Daoud, 2019. "Number of Spanning Trees in the Sequence of Some Graphs," Complexity, Hindawi, vol. 2019, pages 1-22, March.
    12. 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.
    13. Jia-Bao Liu & Muhammad Kashif Shafiq & Haidar Ali & Asim Naseem & Nayab Maryam & Syed Sheraz Asghar, 2019. "Topological Indices of m th Chain Silicate Graphs," Mathematics, MDPI, vol. 7(1), pages 1-16, January.
    14. Li Zhang & Jing Zhao & Jia-Bao Liu & Salama Nagy Daoud, 2019. "Resistance Distance in the Double Corona Based on R -Graph," Mathematics, MDPI, vol. 7(1), pages 1-13, January.
    15. Li Zhang & Jing Zhao & Jia-Bao Liu & Micheal Arockiaraj, 2018. "Resistance Distance in H -Join of Graphs G 1 , G 2 , … , G k," Mathematics, MDPI, vol. 6(12), pages 1-10, November.
    16. Faxu Li & Hui Xu & Liang Wei & Defang Wang, 2023. "Identifying vital nodes in hypernetwork based on local centrality," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-13, January.
    17. 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.
    18. 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. Lei, Hui & Li, Tao & Ma, Yuede & Wang, Hua, 2018. "Analyzing lattice networks through substructures," Applied Mathematics and Computation, Elsevier, vol. 329(C), pages 297-314.
    2. Liu, Jia-Bao & Pan, Xiang-Feng, 2015. "A unified approach to the asymptotic topological indices of various lattices," Applied Mathematics and Computation, Elsevier, vol. 270(C), pages 62-73.
    3. Jia-Bao Liu & Mobeen Munir & Amina Yousaf & Asim Naseem & Khudaija Ayub, 2019. "Distance and Adjacency Energies of Multi-Level Wheel Networks," Mathematics, MDPI, vol. 7(1), pages 1-9, January.
    4. Leurent, Martin & Jasserand, Frédéric & Locatelli, Giorgio & Palm, Jenny & Rämä, Miika & Trianni, Andrea, 2017. "Driving forces and obstacles to nuclear cogeneration in Europe: Lessons learnt from Finland," Energy Policy, Elsevier, vol. 107(C), pages 138-150.
    5. Jia-Bao Liu & S. N. Daoud, 2019. "Number of Spanning Trees in the Sequence of Some Graphs," Complexity, Hindawi, vol. 2019, pages 1-22, March.
    6. Praba, B. & Saranya, R., 2020. "Application of the graph cellular automaton in generating languages," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 168(C), pages 111-121.
    7. Shin, Kong Joo & Managi, Shunsuke, 2017. "Liberalization of a retail electricity market: Consumer satisfaction and household switching behavior in Japan," Energy Policy, Elsevier, vol. 110(C), pages 675-685.
    8. Bin Yang & Vinayak V. Manjalapur & Sharanu P. Sajjan & Madhura M. Mathai & Jia-Bao Liu, 2019. "On Extended Adjacency Index with Respect to Acyclic, Unicyclic and Bicyclic Graphs," Mathematics, MDPI, vol. 7(7), pages 1-9, July.
    9. Webber, Phil & Gouldson, Andy & Kerr, Niall, 2015. "The impacts of household retrofit and domestic energy efficiency schemes: A large scale, ex post evaluation," Energy Policy, Elsevier, vol. 84(C), pages 35-43.
    10. Song, Jingjing & Wallin, Fredrik & Li, Hailong, 2017. "District heating cost fluctuation caused by price model shift," Applied Energy, Elsevier, vol. 194(C), pages 715-724.
    11. Shaohui Wang & Chunxiang Wang & Lin Chen & Jia-Bao Liu & Zehui Shao, 2018. "Maximizing and Minimizing Multiplicative Zagreb Indices of Graphs Subject to Given Number of Cut Edges," Mathematics, MDPI, vol. 6(11), pages 1-10, October.
    12. Das, Kinkar Ch. & Mojallal, Seyed Ahmad, 2016. "Extremal Laplacian energy of threshold graphs," Applied Mathematics and Computation, Elsevier, vol. 273(C), pages 267-280.

    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:291:y:2016:i:c:p:84-88. 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.