On the connectivity of total graphs

DOI10.1007/BF01419429MaRDI QIDQ2545697zbMATH OpenFDO

Authors Takashi Hamada, N. Toshio, Izumi Yoshimura

Publication date 1972

Published in Mathematische Annalen (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/162240

Mathematics Subject Classification ID

Connectivity (05C40)

Cites work

• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Über Minimalstrukturen von Graphen, insbesondere von n-fach zusammenhängenden Graphen

Cited in

(6)

• Internally disjoint trees in the line graph and total graph of the complete bipartite graph
• Traversability and connectivity of the middle graph of a graph
• The generalized connectivity of the line graph and the total graph for the complete bipartite graph
• Generalized connectivity of some total graphs
• Induced cycle path number of derived graphs
• Just two total graphs are complementary

This page was built for publication: On the connectivity of total graphs

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