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

DOI10.1016/S1571-0653(04)00525-6MaRDI QIDQ3439026zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Enumeration of bipartite self-complementary graphs
• scientific article; zbMATH DE number 840694
• The degree sequences of self-complementary graphs
• scientific article; zbMATH DE number 1472103
• scientific article; zbMATH DE number 1185312

Cites work

• Characterisation of potentially bipartite self-complementary bipartitioned sequences
• Enumeration of bipartite self-complementary graphs
• Enumeration of Graphs with Given Partition
• Enumeration of Locally Restricted Digraphs
• scientific article; zbMATH DE number 3756527 (Why is no real title available?)
• scientific article; zbMATH DE number 3777555 (Why is no real title available?)
• scientific article; zbMATH DE number 3319305 (Why is no real title available?)
• On the number of bi-colored graphs
• The degree sequences of self-complementary graphs
• The Number of Linear, Directed, Rooted, and Connected Graphs
• The power group enumeration theorem

Cited in

(2)

• Enumeration of bipartite self-complementary graphs
• Hybridization of particle swarm optimization with quadratic approximation

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

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