IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v7y2019i2p171-d205701.html
   My bibliography  Save this article

Spectra of Subdivision Vertex-Edge Join of Three Graphs

Author

Listed:
  • Fei Wen

    (Institute of Applied Mathematics, Lanzhou Jiaotong University, Lanzhou 730070, China)

  • You Zhang

    (Institute of Applied Mathematics, Lanzhou Jiaotong University, Lanzhou 730070, China)

  • Muchun Li

    (Institute of Applied Mathematics, Lanzhou Jiaotong University, Lanzhou 730070, China)

Abstract

In this paper, we introduce a new graph operation called subdivision vertex-edge join (denoted by G 1 S ▹ ( G 2 V ∪ G 3 E ) for short), and then the adjacency spectrum , the Laplacian spectrum and the signless Laplacian spectrum of G 1 S ▹ ( G 2 V ∪ G 3 E ) are respectively determined in terms of the corresponding spectra for a regular graph G 1 and two arbitrary graphs G 2 and G 3 . All the above can be viewed as the generalizations of the main results in [X. Liu, Z. Zhang, Bull. Malays. Math. Sci. Soc. , 2017:1–17]. Furthermore, we also determine the normalized Laplacian spectrum of G 1 S ▹ ( G 2 V ∪ G 3 E ) whenever G i are regular graphs for each index i = 1 , 2 , 3 . As applications, we construct infinitely many pairs of A-cospectral mates , L-cospectral mates , Q-cospectral mates and L - cospectral mates . Finally, we give the number of spanning trees , the ( degree- ) Kirchhoff index and the Kemeny’s constant of G 1 S ▹ ( G 2 V ∪ G 3 E ) , respectively.

Suggested Citation

  • Fei Wen & You Zhang & Muchun Li, 2019. "Spectra of Subdivision Vertex-Edge Join of Three Graphs," Mathematics, MDPI, vol. 7(2), pages 1-19, February.
    • Handle: RePEc:gam:jmathe:v:7:y:2019:i:2:p:171-:d:205701
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/7/2/171/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/7/2/171/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. van Dam, E.R. & Haemers, W.H., 2002. "Which Graphs are Determined by their Spectrum?," Discussion Paper 2002-66, Tilburg University, Center for Economic Research.
    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. Jia Wei & Jing Wang, 2022. "Spectra of Complemented Triangulation Graphs," Mathematics, MDPI, vol. 10(17), pages 1-9, September.

    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. Xiaoyun Yang & Ligong Wang, 2020. "Laplacian Spectral Characterization of (Broken) Dandelion Graphs," Indian Journal of Pure and Applied Mathematics, Springer, vol. 51(3), pages 915-933, September.
    2. Haemers, W.H., 2005. "Matrices and Graphs," Other publications TiSEM 94b6bd28-71e7-41d3-b978-c, Tilburg University, School of Economics and Management.
    3. van Dam, E.R., 2008. "The spectral excess theorem for distance-regular graphs : A global (over)view," Other publications TiSEM 35daf99b-ad28-4e21-8b1f-6, Tilburg University, School of Economics and Management.
    4. B. R. Rakshith, 2022. "Signless Laplacian spectral characterization of some disjoint union of graphs," Indian Journal of Pure and Applied Mathematics, Springer, vol. 53(1), pages 233-245, March.
    5. van Dam, E.R. & Haemers, W.H. & Koolen, J.H., 2006. "Cospectral Graphs and the Generalized Adjacency Matrix," Discussion Paper 2006-31, Tilburg University, Center for Economic Research.
    6. Haemers, W.H. & Ramezani, F., 2009. "Graphs Cospectral with Kneser Graphs," Discussion Paper 2009-76, Tilburg University, Center for Economic Research.
    7. Estrada, Ernesto, 2007. "Graphs (networks) with golden spectral ratio," Chaos, Solitons & Fractals, Elsevier, vol. 33(4), pages 1168-1182.
    8. Chesnokov, A.A. & Haemers, W.H., 2005. "Regularity and the Generalized Adjacency Spectra of Graphs," Discussion Paper 2005-124, Tilburg University, Center for Economic Research.
    9. van Dam, E.R. & Haemers, W.H., 2010. "An Odd Characterization of the Generalized Odd Graphs," Other publications TiSEM 2478f418-ae83-4ac3-8742-2, Tilburg University, School of Economics and Management.
    10. van Dam, E.R. & Haemers, W.H., 2007. "Developments on Spectral Characterizations of Graphs," Discussion Paper 2007-33, Tilburg University, Center for Economic Research.
    11. Singh, Ranveer & Wankhede, Hitesh, 2024. "A note on graphs with purely imaginary per-spectrum," Applied Mathematics and Computation, Elsevier, vol. 475(C).
    12. Comellas, Francesc & Diaz-Lopez, Jordi, 2008. "Spectral reconstruction of complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(25), pages 6436-6442.
    13. van Dam, E.R. & Haemers, W.H., 2010. "An Odd Characterization of the Generalized Odd Graphs," Discussion Paper 2010-47, Tilburg University, Center for Economic Research.
    14. Haemers, W.H., 2005. "Matrices and Graphs," Discussion Paper 2005-37, Tilburg University, Center for Economic Research.
    15. Zhang, Xiao-Qin & Cui, Shu-Yu & Tian, Gui-Xian, 2022. "Signless Laplacian state transfer on Q-graphs," Applied Mathematics and Computation, Elsevier, vol. 425(C).
    16. Al-Yakoob, Salem & Kanso, Ali & Stevanović, Dragan, 2022. "On Hosoya’s dormants and sprouts," Applied Mathematics and Computation, Elsevier, vol. 430(C).
    17. 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.
    18. Yu, Guihai & Liu, Xin & Qu, Hui, 2017. "Singularity of Hermitian (quasi-)Laplacian matrix of mixed graphs," Applied Mathematics and Computation, Elsevier, vol. 293(C), pages 287-292.
    19. Wang, Xiangrong & Trajanovski, Stojan & Kooij, Robert E. & Van Mieghem, Piet, 2016. "Degree distribution and assortativity in line graphs of complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 445(C), pages 343-356.
    20. Abiad, Aida & Alfaro, Carlos A., 2021. "Enumeration of cospectral and coinvariant graphs," Applied Mathematics and Computation, Elsevier, vol. 408(C).

    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:gam:jmathe:v:7:y:2019:i:2:p:171-:d:205701. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.