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

The behavior of Tutte polynomials of graphs under five graph operations and its applications

Author

Listed:
  • Liao, Yunhua
  • Aziz-Alaoui, M.A.
  • Zhao, Junchan
  • Hou, Yaoping

Abstract

The Tutte polynomial of a graph has many important applications in combinatorics, physics, and biology. Graph operations, such as triangulation and subdivision, have been widely used in building complex network models. In this paper, we show how the Tutte polynomial changes with five graph operations. Firstly, we study the connections between graph G and its operation graphs: the triangulation graph R(G), the diamond graph Z(G), the quadrilateral graph Q(G), the 2-triangulation graph R2(G), and the Wheatstone bridge graph W(G), in the respect of spanning subgraphs. Secondly, using these relations, we investigate the structure of the set of spanning subgraphs of each operation graph, and find that it is constituted by 2|E(G)| disjoint subsets. Then, we derive the contribution of each subset by an indirect method. Finally, we gain the Tutte polynomials of these five operation graphs. Moreover, we consider the Tutte polynomials of the pseudofractal scale-free network and a classic diamond hierarchical lattice as an application. Our technique can be applied to study other graph polynomials.

Suggested Citation

  • Liao, Yunhua & Aziz-Alaoui, M.A. & Zhao, Junchan & Hou, Yaoping, 2019. "The behavior of Tutte polynomials of graphs under five graph operations and its applications," Applied Mathematics and Computation, Elsevier, vol. 363(C), pages 1-1.
    • Handle: RePEc:eee:apmaco:v:363:y:2019:i:c:37
    DOI: 10.1016/j.amc.2019.124641
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300319306332
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2019.124641?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. Mehatari, Ranjit & Banerjee, Anirban, 2015. "Effect on normalized graph Laplacian spectrum by motif attachment and duplication," Applied Mathematics and Computation, Elsevier, vol. 261(C), pages 382-387.
    2. Gong, Helin & Jin, Xian’an, 2017. "A general method for computing Tutte polynomials of self-similar graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 483(C), pages 117-129.
    3. Ma, Fei & Su, Jing & Hao, Yongxing & Yao, Bing & Yan, Guanghui, 2018. "A class of vertex–edge-growth small-world network models having scale-free, self-similar and hierarchical characters," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 492(C), pages 1194-1205.
    4. Xie, Pinchen & Zhang, Zhongzhi & Comellas, Francesc, 2016. "The normalized Laplacian spectrum of subdivisions of a graph," Applied Mathematics and Computation, Elsevier, vol. 286(C), pages 250-256.
    5. 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.
    6. Xie, Pinchen & Zhang, Zhongzhi & Comellas, Francesc, 2016. "On the spectrum of the normalized Laplacian of iterated triangulations of graphs," Applied Mathematics and Computation, Elsevier, vol. 273(C), pages 1123-1129.
    7. Zhongzhi Zhang & Shuigeng Zhou & Lichao Chen, 2007. "Evolving pseudofractal networks," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 58(3), pages 337-344, August.
    Full references (including those not matched with items on IDEAS)

    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, 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.
    2. Sun, Shaowei & Das, Kinkar Ch., 2019. "On the second largest normalized Laplacian eigenvalue of graphs," Applied Mathematics and Computation, Elsevier, vol. 348(C), pages 531-541.
    3. Wang, Chengyong & Guo, Ziliang & Li, Shuchao, 2018. "Expected hitting times for random walks on the k-triangle graph and their applications," Applied Mathematics and Computation, Elsevier, vol. 338(C), pages 698-710.
    4. 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.
    5. Cui, Shu-Yu & Tian, Gui-Xian, 2017. "The spectra and the signless Laplacian spectra of graphs with pockets," Applied Mathematics and Computation, Elsevier, vol. 315(C), pages 363-371.
    6. Zong, Yue & Dai, Meifeng & Wang, Xiaoqian & He, Jiaojiao & Zou, Jiahui & Su, Weiyi, 2018. "Network coherence and eigentime identity on a family of weighted fractal networks," Chaos, Solitons & Fractals, Elsevier, vol. 109(C), pages 184-194.
    7. Xie, Pinchen & Zhang, Zhongzhi & Comellas, Francesc, 2016. "On the spectrum of the normalized Laplacian of iterated triangulations of graphs," Applied Mathematics and Computation, Elsevier, vol. 273(C), pages 1123-1129.
    8. Palacios, José Luis & Markowsky, Greg, 2021. "Kemeny’s constant and the Kirchhoff index for the cluster of highly symmetric graphs," Applied Mathematics and Computation, Elsevier, vol. 406(C).
    9. 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.
    10. 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.
    11. Banerjee, Anirban & Mehatari, Ranjit, 2015. "Characteristics polynomial of normalized Laplacian for trees," Applied Mathematics and Computation, Elsevier, vol. 271(C), pages 838-844.
    12. Sreejith, R.P. & Jost, Jürgen & Saucan, Emil & Samal, Areejit, 2017. "Systematic evaluation of a new combinatorial curvature for complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 101(C), pages 50-67.
    13. Rasul Kochkarov & Azret Kochkarov, 2022. "Introduction to the Class of Prefractal Graphs," Mathematics, MDPI, vol. 10(14), pages 1-17, July.
    14. Türkoğlu, Alpar & Berker, A. Nihat, 2021. "Phase transitions of the variety of random-field Potts models," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 583(C).
    15. Artun, E. Can & Keçoğlu, Ibrahim & Türkoğlu, Alpar & Berker, A. Nihat, 2023. "Multifractal spin-glass chaos projection and interrelation of multicultural music and brain signals," Chaos, Solitons & Fractals, Elsevier, vol. 167(C).
    16. Knor, Martin & Škrekovski, Riste, 2013. "Deterministic self-similar models of complex networks based on very symmetric graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(19), pages 4629-4637.
    17. Xie, Pinchen & Yang, Bingjia & Zhang, Zhongzhi & Andrade, Roberto F.S., 2018. "Exact evaluation of the causal spectrum and localization properties of electronic states on a scale-free network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 502(C), pages 40-48.
    18. Tunca, Egemen & Berker, A. Nihat, 2022. "Renormalization-group theory of the Heisenberg model in d dimensions," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 608(P2).
    19. Rasul Kochkarov, 2021. "Research of NP-Complete Problems in the Class of Prefractal Graphs," Mathematics, MDPI, vol. 9(21), pages 1-20, October.

    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:363:y:2019:i:c:37. 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.