Total Graphs and Traversability

DOI10.1017/S0013091500011421MaRDI QIDQ5526635zbMATH OpenOpenAlexFDO

Authors Mehdi Behzad, Gary Chartrand

Publication date 1966

Published in Proceedings of the Edinburgh Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0013091500011421

zbMATH Keywords

topology

Cites work

• Congruent Graphs and the Connectivity of Graphs
• The existence of complete cycles in repeated line-graphs

Cited in

(14)

• Traversability and connectivity of the middle graph of a graph
• Just two total graphs are complementary
• Connectivity, line-connectivity and J-conntection of the total graph
• Total coloring and total matching: polyhedra and facets
• New composition of graphs and their Wiener indices
• On the hyperbolicity of bipartite graphs and intersection graphs
• EULERIAN AND HAMILTONIAN PROPERTIES OF GALLAI AND ANTI-GALLAI TOTAL GRAPHS
• The Total Group of a Graph
• A Characterization of Total Graphs
• Graph theory
• On mixed metric dimension in subdivision, middle, and total graphs
• On the total domination number of total graphs
• On the non-incident quasi-total graph and its complement
• Exploring second Zagreb and neighborhood first Zagreb indices in (,)-generalized transformation graphs: a dual-index approach to network analysis

This page was built for publication: Total Graphs and Traversability

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