Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/107545
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Computing | en_US |
| dc.creator | Cao, Y | en_US |
| dc.creator | Chen, H | en_US |
| dc.creator | Wang, S | en_US |
| dc.date.accessioned | 2024-07-03T04:31:39Z | - |
| dc.date.available | 2024-07-03T04:31:39Z | - |
| dc.identifier.issn | 0302-9743 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10397/107545 | - |
| dc.description | LATIN 2024 : Theoretical Informatics : 16th Latin American Symposium Puerto Varas, Chile, March 18–22, 2024 | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Springer | en_US |
| dc.rights | © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024 | en_US |
| dc.rights | This version of the proceeding paper has been accepted for publication, after peer review (when applicable) and is subject to Springer Nature’s AM terms of use(https://www.springernature.com/gp/open-research/policies/accepted-manuscript-terms), but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: http://dx.doi.org/10.1007/978-3-031-55601-2_1. | en_US |
| dc.subject | Degree sequence | en_US |
| dc.subject | Pseudo-split graph | en_US |
| dc.subject | Self-complementary graph | en_US |
| dc.subject | Split graph | en_US |
| dc.title | Self-complementary (pseudo-)split graphs | en_US |
| dc.type | Conference Paper | en_US |
| dc.identifier.spage | 3 | en_US |
| dc.identifier.epage | 18 | en_US |
| dc.identifier.volume | 14579 LNCS | en_US |
| dc.identifier.doi | 10.1007/978-3-031-55601-2_1 | en_US |
| dcterms.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. | en_US |
| dcterms.accessRights | open access | en_US |
| dcterms.bibliographicCitation | Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics), 2024, v. 14579, p. 3-18 | en_US |
| dcterms.isPartOf | Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics) | en_US |
| dcterms.issued | 2024 | - |
| dc.identifier.scopus | 2-s2.0-85188725522 | - |
| dc.relation.ispartofbook | LATIN 2024: Theoretical Informatics 16th Latin American Symposium Puerto Varas, Chile, March 18–22, 2024 Proceedings, Part II | en_US |
| dc.relation.conference | Latin American Symposium [LATIN] | en_US |
| dc.identifier.eissn | 1611-3349 | en_US |
| dc.description.validate | 202407 bcch | en_US |
| dc.description.oa | Accepted Manuscript | en_US |
| dc.identifier.FolderNumber | a2926 | - |
| dc.identifier.SubFormID | 48778 | - |
| dc.description.fundingSource | RGC | en_US |
| dc.description.fundingSource | Others | en_US |
| dc.description.fundingText | National Natural Science Foundation of China | en_US |
| dc.description.pubStatus | Published | en_US |
| dc.description.oaCategory | Green (AAM) | en_US |
| Appears in Collections: | Conference Paper | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Cao_Self-complementary_Pseudo_Split.pdf | Pre-Published version | 840.68 kB | Adobe PDF | View/Open |
Page views
200
Citations as of Feb 9, 2026
Downloads
96
Citations as of Feb 9, 2026
SCOPUSTM
Citations
1
Citations as of May 8, 2026
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.



