Bounds on Spectral Radius and Signless Laplacian Spectral Radius for Generalized Core-satellite Graphs
DOI:
https://doi.org/10.29020/nybg.ejpam.v18i4.5360Keywords:
Spectral radius, Signless Laplacian spectral radius, Generalised Coresatellite graphsAbstract
A Generalized core-satellite graph Θ(c, S, η∗) belongs to the family of graphs of diameter two. It has a central core of nodes connected to a few satellites, where all satellite cliques are not identical and might be of different sizes. These graphs can be used to model any real-world complex network. Using core-satellite graphs, properties like hierarchical structure can be conveniently modeled for large complex networks. In this paper, we obtain the lower and upper bounds for the spectral radius and signless Laplacian spectral radius of the generalized core-satellite graph, in terms of number of vertices, number of edges, and the graph parameters associated with the structure of the graph in both satellites and the core.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Malathy. V, Kalyani Desikan

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.