Self-complementary (Pseudo-)Split Graphs

Yixin Cao, Haowei Chen, Shenghua Wang

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

Abstract

We study split graphs and pseudo-split graphs that are isomorphic to their complements. These special subclasses of self-complementary graphs are actually the core of self-complementary graphs. Indeed, we show that all realizations of forcibly self-complementary degree sequences are pseudo-split graphs. We also give formulas to calculate the number of self-complementary (pseudo-)split graphs of a given order, and show that Trotignon’s conjecture holds for all self-complementary split graphs.

Original languageEnglish
Title of host publicationLATIN 2024
Subtitle of host publicationTheoretical Informatics - 16th Latin American Symposium, 2024, Proceedings
EditorsJosé A. Soto, Andreas Wiese
PublisherSpringer Science and Business Media Deutschland GmbH
Pages3-18
Number of pages16
ISBN (Print)9783031556005
DOIs
Publication statusPublished - Mar 2024
Event16th Latin American Symposium on Theoretical Informatics, LATIN 2042 - Puerto Varas, Chile
Duration: 18 Mar 202422 Mar 2024

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume14579 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference16th Latin American Symposium on Theoretical Informatics, LATIN 2042
Country/TerritoryChile
CityPuerto Varas
Period18/03/2422/03/24

Keywords

  • degree sequence
  • pseudo-split graph
  • self-complementary graph
  • split graph

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Self-complementary (Pseudo-)Split Graphs'. Together they form a unique fingerprint.

Cite this