Graphs with cyclomatic number three having panconnected square. II

DOI10.1016/J.AKCEJ.2020.02.002MaRDI QIDQ4956192zbMATH OpenOpenAlexFDO

Authors W. Hemakul, Sirirat Singhun, Gek L. Chia

Publication date 1 September 2021

Published in AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/j.akcej.2020.02.002

zbMATH Keywords

cyclomatic numberpanconnectedsquare of a graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Graphs with cyclomatic number three having panconnected square
• Graphs with cyclomatic number two having panconnected square
• The square of a connected S(K1,3)-free graph is vertex pancyclic
• Forbidden subgraphs and hamiitonian properties in the square of a connected graph
• Pan-connectedness of graphs with large neighborhood unions

Cites work

• Graphs with cyclomatic number three having panconnected square
• Graphs with cyclomatic number two having panconnected square
• In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
• On graphs whose square have strong Hamiltonian properties

Cited in

(3)

• The square of a connected S(K1,3)-free graph is vertex pancyclic
• Graphs with cyclomatic number three having panconnected square
• Graphs with cyclomatic number two having panconnected square

This page was built for publication: Graphs with cyclomatic number three having panconnected square. II

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