-
More on almost self-complementary graphsFrancetić, Nevena ; Šajna, MatejaA graph ▫$X$▫ is called almost self-complementary if it is isomorphic to one of its almost complements ▫$X^C - \mathcal{I}$▫, where ▫$X^C$▫ denotes the complement of ▫$X$▫ and ▫$\mathcal{I}$▫ a ... perfect matching (1-factor) in ▫$X^C$▫. If ▫$\mathcal{I}$▫ is a perfect matching in ▫$X^C$▫ and ▫$\varphi : X \to X^C - \mathcal{I}$▫ is an isomorphism, then the graph ▫$X$▫ is said to be fairly almost self-complementary if ▫$\varphi$▫ preserves ▫$\mathcal{I}$▫ setwise, and unfairly almost self-complementary if it does not. In this paper we construct connected graphs of all possible orders that are fairly and unfairly almost self-complementary, fairly but not unfairly almost self-complementary, and unfairly but not fairly almost self-complementary, respectively, as well as regular graphs of all possible orders that are fairly and unfairly almost self-complementary. Two perfect matchings ▫$\mathcal{I}$▫ and ▫$\mathcal{J}$▫ in ▫$X^C$▫ are said to be ▫$X$▫-non-isomorphic if no isomorphism from ▫$X + \mathcal{I}$▫ to ▫$X + \mathcal{J}$▫ induces an automorphism of ▫$X$▫. We give a constructive proof to show that there exists a graph ▫$X$▫ that is almost self-complementary with respect to two ▫$X$▫-non-isomorphic perfect matchings for every even order greater than or equal to four.Vir: Discrete mathematics. - ISSN 0012-365X (Vol. 309, iss. 10, 2009, str. 3106-3112)Vrsta gradiva - članek, sestavni delLeto - 2009Jezik - angleškiCOBISS.SI-ID - 15166809
Avtor
Francetić, Nevena |
Šajna, Mateja
Teme
matematika |
teorija grafov |
skoraj sebi komplementarni grafi |
popolno prirejanje |
povezan graf |
regularni graf |
mathematics |
graph theory |
self-complementary graph |
perfect matching |
connected graph |
regular graph |
fairly almost self-complementary graph |
unfairly almost self-complementary graph
Vnos na polico
Trajna povezava
- URL:
Faktor vpliva
Dostop do baze podatkov JCR je dovoljen samo uporabnikom iz Slovenije. Vaš trenutni IP-naslov ni na seznamu dovoljenih za dostop, zato je potrebna avtentikacija z ustreznim računom AAI.
Leto | Faktor vpliva | Izdaja | Kategorija | Razvrstitev | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Baze podatkov, v katerih je revija indeksirana
Ime baze podatkov | Področje | Leto |
---|
Povezave do osebnih bibliografij avtorjev | Povezave do podatkov o raziskovalcih v sistemu SICRIS |
---|---|
Francetić, Nevena | |
Šajna, Mateja | 13432 |
Izberite prevzemno mesto:
Prevzem gradiva po pošti
Obvestilo
Gesla v Splošnem geslovniku COBISS
Izbira mesta prevzema
Mesto prevzema | Status gradiva | Rezervacija |
---|
Prosimo, počakajte trenutek.