A Characterization of Forcibly Tripartite Self-Complementary class of Partitioned Sequences

DOI10.1016/S1571-0653(04)00525-6zbMath1284.05135OpenAlexW2078259394MaRDI QIDQ3439026

N. S. Bhave

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0653(04)00525-6

zbMATH Keywords

chromatically non-isomorphic bipartite self-complementary graphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Related Items (1)

Hybridization of particle swarm optimization with quadratic approximation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of bi-colored graphs
• Characterisation of potentially bipartite self-complementary bipartitioned sequences
• The degree sequences of self-complementary graphs
• The power group enumeration theorem
• Enumeration of Locally Restricted Digraphs
• Enumeration of Graphs with Given Partition
• The Number of Linear, Directed, Rooted, and Connected Graphs
• Enumeration of bipartite self-complementary graphs

This page was built for publication: A Characterization of Forcibly Tripartite Self-Complementary class of Partitioned Sequences