Unicyclic signed graphs with the first n + 1 2 largest energies
From MaRDI portal
Publication:2197444
Recommendations
Cites work
- A new method of comparing the energies of subdivision bipartite graphs
- Bicyclic signed graphs with at most one odd cycle and maximal energy
- Bicyclic signed graphs with minimal and second minimal energy
- Complete solution to a conjecture on the maximal energy of unicyclic graphs
- Graph energy
- scientific article; zbMATH DE number 3700888 (Why is no real title available?)
- scientific article; zbMATH DE number 3623599 (Why is no real title available?)
- scientific article; zbMATH DE number 7414712 (Why is no real title available?)
- Matrices in the theory of signed simple graphs
- On products and line graphs of signed graphs, their eigenvalues and energy
- On the extremal energies of trees
- Proof of a conjecture on trees with large energy
- Spectral criterion for cycle balance in networks
- Unicyclic signed graphs with minimal energy
Cited in
(6)- Bicyclic signed graphs with at most one odd cycle and maximal energy
- On ordering of minimal energies in bicyclic signed graphs
- Unicyclic signed graphs with minimal energy
- On signed paths, signed cycles and their energies
- Ordering of the unicyclic signed graphs with perfect matchings by their minimal energies
- Ordering of minimal energies in unicyclic signed graphs
This page was built for publication: Unicyclic signed graphs with the first \(\lfloor \frac{ n + 1}{ 2} \rfloor\) largest energies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2197444)