On tricyclic graphs of a given diameter with minimal energy
From MaRDI portal
Publication:958030
DOI10.1016/J.LAA.2008.08.004zbMATH Open1168.05325OpenAlexW2019432192MaRDI QIDQ958030FDOQ958030
Authors: Shuchao Li, Xuechao Li 
Publication date: 2 December 2008
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2008.08.004
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35)
Cites Work
- Graph theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Unicyclic graphs with given number of pendent vertices and minimal energy
- On minimal energies of trees of a prescribed diameter
- On the minimal energy of trees with a given diameter
- On bicyclic graphs with maximal energy
- Title not available (Why is that?)
- Minimal energy of bicyclic graphs of a given diameter
- On bicyclic graphs with minimal energies
- On minimal energy of unicyclic graphs with prescribed girth and pendent vertices
- Extremal energy trees
Cited In (15)
- More on a conjecture about tricyclic graphs with maximal energy
- Some properties of comaximal right ideal graph of a ring
- Minimal energy of bicyclic graphs of a given diameter
- On the spectral radius of tricyclic graphs with a maximum matching
- On the spectral radius and energy of the weighted adjacency matrix of a graph
- Results on energies for trees with a given diameter having perfect matching
- On the spectral radius of tricyclic graphs with a fixed diameter
- On the tree with diameter 4 and maximal energy
- Title not available (Why is that?)
- On the lower and upper bounds for different indices of tricyclic graphs
- Title not available (Why is that?)
- On the coefficients of the independence polynomial of graphs
- Minimal energy of unicyclic graphs of a given diameter
- On tricyclic graphs whose second largest eigenvalue does not exceed 1
- Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable
This page was built for publication: On tricyclic graphs of a given diameter with minimal energy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q958030)
