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-5zbMath0425.05036OpenAlexW2131166187MaRDI QIDQ1135293

Siddani Bhaskara 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

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

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solution of the Hamiltonian problem for self-complementary graphs
• Parallel concepts in graph theory
• Potentially self-complementary degree sequences
• Hamiltonian arcs in self-complementary graphs
• Selbstkomplementäre Graphen

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