Abstract
Product graphs have been gainfully used in literature to generate mathematical models of complex networks which inherit properties of real networks. Realizing the duplication phenomena imbibed in the definition of corona product of two graphs, we define corona graphs. Given a small simple connected graph which we call basic graph, corona graphs are defined by taking corona product of the basic graph iteratively. We calculate the possibility of having a node of degree k in any corona graph which lead to obtain degree distribution of corona graphs. We determine explicit formulae of eigenvalues, Laplacian eigenvalues and signless Laplacian eigenvalues of corona graphs when the basic graph is regular. Computable expressions of eigenvalues and signless Laplacian eigenvalues are also obtained when the basic graph is a star graph.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Albert, R., Barabási, A.-L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47 (2002)
Barik, S., Pati, S., Sarma, B.: The spectrum of the corona of two graphs. SIAM J. Discrete Math. 21, 47–56 (2007)
Bapat, R.B.: Graphs and matrices. Springer (2010)
Crovella, M.E., Taqqu, M.S.: Estimating the heavy tail index from scaling properties. Methodol. Comput. Appl. 1, 55–79 (1999)
Cui, S.-Y., Tian, G.-X.: The spectrum and the signless Laplacian spectrum of coronae. Linear Algebra Appl. 437, 1692–1703 (2012)
Cvetković, D., Simić, S.K.: Towards a spectral theory of graphs based on the signless Laplacian, I. Publ. Inst. Math(Beograd)(NS) 85, 19–33 (2009)
Cvetković, D., Simić, S.K.: Towards a spectral theory of graphs based on the signless Laplacian, II. Linear Algebra Appl. 432, 2257–2272 (2010)
Cvetković, D., Simić, S.K.: Towards a spectral theory of graphs based on the signless Laplacian, III. Appl. Anal. Discrete Math. 4, 156–166 (2010)
Frucht, R., Harary, F.: On the corona of two graphs. Aequationes Math. 4, 322–325 (1970)
Haemers, W.H., Spence, E.: Enumeration of cospectral graphs. European J. Combin. 25, 199–211 (2004)
Ispolatov, I., Krapivsky, P.L., Yuryev, A.: Duplication-divergence model of protein interaction network. Phys. Rev. EÂ 71, 061911 (2005)
Leskovec, J., Chakrabarti, D., Kleinberg, J., Faloutsos, C., Ghahramani, Z.: Kronecker graphs: An approach to modeling networks. J. Mach. Learn. Res. 11, 985–1042 (2010)
Misiewicz, J.: Fat-Tailed Distributions: Data, Diagnostics, and Dependence (2011)
Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 45, 167–256 (2003)
Parsonage, E., Nguyen, H.X., Bowden, R., Knight, S., Falkner, N., Roughan, M.: Generalized graph products for network design and analysis. In: 19th IEEE International Conference on Network Protocols (ICNP), pp. 79–88 (2011)
Rachev, S.T.: Handbook of Heavy Tailed Distributions in Finance: Handbooks in Finance 1. Elsevier (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Sharma, R., Adhikari, B., Mishra, A. (2015). On Spectra of Corona Graphs. In: Ganguly, S., Krishnamurti, R. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2015. Lecture Notes in Computer Science, vol 8959. Springer, Cham. https://doi.org/10.1007/978-3-319-14974-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-14974-5_13
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-14973-8
Online ISBN: 978-3-319-14974-5
eBook Packages: Computer ScienceComputer Science (R0)