On unicyclic graphs with given number of pendent vertices and minimal energy
From MaRDI portal
Publication:2174094
DOI10.1016/j.laa.2020.03.024zbMath1479.05192OpenAlexW3011585092MaRDI QIDQ2174094
Mushtaq A. Bhat, Shariefuddin Pirzada
Publication date: 17 April 2020
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2020.03.024
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12)
Related Items (3)
Energy of strong double graphs ⋮ On graphs with minimal distance signless Laplacian energy ⋮ Nordhaus-Gaddum-type relations for arithmetic-geometric spectral radius and energy
Cites Work
- Unicyclic graphs with given number of pendent vertices and minimal energy
- Signless Laplacian energy of a graph and energy of a line graph
- Graph Energy
- Bounds for graph energy in terms of vertex covering and clique numbers
- Note on unicyclic graphs with given number of pendent vertices and minimal energy
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On unicyclic graphs with given number of pendent vertices and minimal energy