The number of open chains of length three and the parity of the number of open chains of length k in self-complementary graphs

DOI10.1016/0012-365X(79)90136-5MaRDI QIDQ1135293zbMATHOpenAlexFDO

Authors S. B. Rao

Publication date 1979

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(79)90136-5

zbMATH Keywords

self-complementary graphsopen chains of length three

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3182201 (Why is no real title available?)
• scientific article; zbMATH DE number 3777555 (Why is no real title available?)
• scientific article; zbMATH DE number 3517193 (Why is no real title available?)
• scientific article; zbMATH DE number 3194323 (Why is no real title available?)
• Hamiltonian arcs in self-complementary graphs
• Parallel concepts in graph theory
• Potentially self-complementary degree sequences
• Selbstkomplementäre Graphen
• Solution of the Hamiltonian problem for self-complementary graphs

Cited in

(1)

• Variations sur le thème \({E+\overline {E} = XY}\) (Variations on the theme \({E+\overline {E} = XY})\)

This page was built for publication: The number of open chains of length three and the parity of the number of open chains of length k in self-complementary graphs

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