JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE) ›› 2021, Vol. 56 ›› Issue (7): 65-72.doi: 10.6040/j.issn.1671-9352.0.2020.230

Previous Articles    

Generalized characteristic polynomial of subdivision Q-neighbourhood corona graphs and its application

YANG Ying1, LI Mu-chun1*, ZHANG You2   

  1. 1. College of Mathematics and Physics, Lanzhou Jiaotong University, Lanzhou 730070, Gansu, China;
    2. College of Computer and Engineering, Shangqiu College, Shangqiu 476000, Henan, China
  • Published:2021-07-19

Abstract: The subdivision Q-neighborhood vertex corona G1□·QG2 of two regular graphs G1 and G2 for regular is the graph obtained from vertex disjoint union of Q(G1) and |V(G1)| copies of G2, and by joining the neighbors of the ith vertex of |V(G1)| to every vertex in the ith copy of G2; the subdivision Q-neighborhood edge corona G1□— QG2 is the graph obtained from vertex disjoint union of Q(G1) and |I(G1)| copies of G2, and by joining the neighbors of the ith vertex of I(G1) to every vertex in the ith copy of G2, where Q(G1) is obtained from G1 by inserting a new vertex into every edge of G1 and then joining by edges those pair of new vertices which lie on adjacent edges of G1, and I(G1) is denoted by the set of such new vertices inserted in each edge of G1. Based on above, the generalized characteristic polynomial and Φ-spectrum of G1□·QG2 and G1□— QG2 are determined, respectively. As an application, their normalized Laplacian spectrum are obtained. Besides, infinitely many pairs of Φ-cospectral mates are also constructed.

Key words: subdivision Q-neighborhood vertex corona, subdivision Q-neighborhood edge corona, generalized characteristic polynomial, Φ-cospectral graphs

CLC Number: 

  • O157.5
[1] WANG W, LI F, LU H L, et al. Graphs determined by their generalized characteristic polynomials[J]. Linear Algebra and Its Applications, 2011, 434(5):1378-1387.
[2] FRUCHT R, HARARY F. On the corona of two graphs[J]. Aequationes Mathematicae, 1970, 4(3):322-325.
[3] BARIK S, PATI S, SARMA B K. The spectrum of the corona of two graphs[J]. SIAM Journal on Discrete Mathematics, 2007, 21(1):47-56
[4] HOU Y, SHIU W C. The spectrum of the edge corona of two graphs[J]. The Electronic Journal of Linear Algebra, 2010, 20(1):586-594.
[5] WANG S L, ZHOU B. The signless Laplacian spectra of the corona and edge corona of two graphs[J]. Linear and Multilinear Algebra, 2013, 61(2):197-204.
[6] LIU X G, ZHANG Z H. Spectra of subdivision-vertex join and subdivision-edge join of two graphs[J]. Bulletin of the Malaysian Mathematical Sciences Society, 2019, 42(1):15-31.
[7] SONG Caixia, HUANG Qiongxiang, HUANG Xueyi. Spectra of subdivision vertex-edge corona for graphs[J]. Adcances in Mathematics(CHINA), 2016, 45(1):37-47.
[8] LI Muchun, ZHANG You, WEN Fei. The normalized Laplacian spectrum of subdivision vertex-edge corona for graphs[J]. Journal of Mathematical Research with Applications, 2019, 39(3):221-232.
[9] WEN F, ZHANG Y, LI M C. Spectra of subdivision vertex-edge join of three graphs[J]. Mathematics, 2019, 7(2):171.
[10] DAS A, PANIGRAHI P. Normalized Laplacian spectrum of some Q-coronas of two regular graphs[J]. Discussiones Mathematicae-General Algebra and Applications, 2021, 41(1):127.
[11] CVETKOVIC D, ROWLINSON P, SIMIC S. Characterizations by spectra[M] //An Introduction to the Theory of Graph Spectra. Cambridge: Cambridge University Press, 2009: 104-135.
[12] HORN R A, ZHANG F Z. Basic properties of the schur complement[M] //The Schur Complement and Its Applications. New York: Springer-Verlag, 2005.
[13] HORN R A, JOHNSON C R. Topics in matrix analysis[M]. Cambridge: Cambridge University Press, 1994.
[1] XIE Cheng-ling, MA Hai-cheng. Matching equivalent classes of union graphs of two vertices and a path [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2021, 56(1): 29-34.
[2] WEI Zong-tian, FANG Hui, LI Yin-kui. On the facility systems reliability based on network location [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2020, 55(10): 77-82.
[3] LI Jing-jing, BIAN Hong, YU Hai-zheng. Maximum matching forcing number in some special graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2020, 55(10): 71-76.
[4] LIU Jia, SUN Lei. Planar graphs without 4-cycle or chordal-6-cycle are(3,0,0)-colorable [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2018, 53(12): 31-40.
[5] . Vertex-distinguishing E-total coloring of complete bipartite graph K10,n with 10≤n≤90 [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2018, 53(12): 23-30.
[6] ZHANG You, HUANG Li-na, LI Mu-chun. Vertex distinguishing edge coloring of a hexagonal system [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2018, 53(12): 41-47.
[7] CHEN Hong-ling, WANG Hui-juan, GAO Hong-wei. Linear arboricity of graphs embedded in a surface of non-negative Euler characteristic [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2018, 53(12): 17-22.
[8] LI Mei-lian, DENG Qing-ying. Maple calculation of the transition polynomial of plane graph [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2018, 53(10): 27-34.
[9] LIU Xiao-hua, MA Hai-cheng. Order of matching energy and Hosoya index of Q-shape graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2018, 53(8): 61-65.
[10] . Vertex-distinguishing IE-total coloring and general-total coloring of K1,3,p and K1,4,p [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2018, 53(8): 53-60.
[11] CHEN Hong-yu, ZHANG Li. Linear 2-arboricity of planar graphs with 4-cycles have no common vertex [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(12): 36-41.
[12] HE Yu-ping, WANG Zhi-wen, CHEN Xiang-en. Vertex-distinguishing total coloring of mC8 [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(10): 24-30.
[13] LI Ting-ting, LAO Hui-xue. On the mean value of a hybrid arithmetic function [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(8): 70-74.
[14] WANG Xiao-li, WANG Hui-juan, LIU Bin. Total coloring of planar graphs with maximum degree seven [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(8): 100-106.
[15] WANG Ye, SUN Lei. Every 1-planar graph without cycles of length 3 or 4 is 5-colorable [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(4): 34-39.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!