Pages that link to "Item:Q2856750"

The following pages link to A new method of comparing the energies of subdivision bipartite graphs (Q2856750):

Displaying 8 items.

• Two subgraph grafting theorems on the energy of bipartite graphs (Q501270) (← links)
• Maximal energy of subdivisions of graphs with a fixed chromatic number (Q745924) (← links)
• On the minimal matching energies of unicyclic graphs (Q1720335) (← links)
• On line graphs with maximum energy (Q1743069) (← links)
• A sharp upper bound on the incidence energy of graphs in terms of connectivity (Q1931756) (← links)
• The proof of a conjecture on the comparison of the energies of trees (Q1934319) (← links)
• Unicyclic signed graphs with the first \(\lfloor \frac{ n + 1}{ 2} \rfloor\) largest energies (Q2197444) (← links)
• Bipartite unicyclic graphs with large energies (Q2346514) (← links)