Energy of strongly connected digraphs whose underlying graph is a cycle

DOI10.4067/S0716-09172016000400003MaRDI QIDQ2967878zbMATH OpenOpenAlexFDO

Authors Juan Monsalve, Juan Rada

Publication date 2 March 2017

Published in Proyecciones (Antofagasta) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4067/s0716-09172016000400003

zbMATH Keywords

characteristic polynomialdigraphsdirected cyclesenergystrongly connected

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory (05C90)

Recommendations

• Upper bound for the energy of strongly connected digraphs
• Energy of graphs containing disjoint cycles
• Energy bounds for graphs with fixed cyclomatic number
• On the extremal energy of bicyclic digraphs
• Bicyclic digraphs with maximal energy
• On the energy of some circulant graphs
• On the energy of digraphs
• Energy of weighted digraphs
• On bounds for the energy of graphs and digraphs
• Hypoenergetic and strongly hypoenergetic k-cyclic graphs

Cited in

(5)

• The energy of directed hexagonal systems
• Upper bound for the energy of strongly connected digraphs
• On the energy of digraphs
• Spectra and energy of bipartite signed digraphs
• On energy of the digraph associated with finitge cyclic group \(\mathbb{Z}_n\)

This page was built for publication: Energy of strongly connected digraphs whose underlying graph is a cycle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2967878)