Connectedness and acyclicity of the transposed square of a graph

MaRDI QIDQ1078583zbMATH OpenFDO

Authors B. D. Acharya

Publication date 1986

Published in Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

acyclic graphsconnected graphstransposed square of a given graph

Mathematics Subject Classification ID

Connectivity (05C40) Graph theory (05C99)

Recommendations

• The square of a connected S(K1,3)-free graph is vertex pancyclic
• Characterizing forbidden pairs for Hamiltonian squares
• Graphs with cyclomatic number two having panconnected square
• Complexité de problèmes liés aux graphes sans circuit
• On the number of edges in the transitive closure of a graph

Cited in

(1)

• scientific article; zbMATH DE number 4212087 (Why is no real title available?)

This page was built for publication: Connectedness and acyclicity of the transposed square of a graph

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