-spectral radius of unicyclic and bicyclic graphs with fixed girth or fixed number of pendant vertices.
Joyentanuj DasIswar MahatoPublished in: Comput. Appl. Math. (2024)
Keyphrases
- fixed number
- weighted graph
- random graphs
- undirected graph
- labeled graphs
- spectral decomposition
- adjacency matrix
- attributed graphs
- hamiltonian cycle
- maximal cliques
- finite number
- planar graphs
- connected subgraphs
- spectral methods
- average degree
- graph matching
- identical parallel machines
- spectral analysis
- graph theoretic
- graph representation
- directed edges
- connected graphs
- laplacian matrix
- graph theory
- directed graph
- graph structures
- graph clustering
- shortest distance
- normalized cut
- special case