Strongly i-Bicritical Graphs
A graph $G$ is \emph{strongly $i$-bicritical} if it has independent domination number $i(G) \geq 3$, and $i(G - \{x, y\}) = i(G) - 2$ whenever $x$ and $y$ are two non-adjacent vertices of $G$. We describe five constructions of strongly $i$-bicritical graphs. For four of them, necessary and sufficien...
Gorde:
| Egile Nagusiak: | , , |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
Georgia Southern University
2024-01-01
|
| Saila: | Theory and Applications of Graphs |
| Gaiak: | |
| Sarrera elektronikoa: | https://digitalcommons.georgiasouthern.edu/tag/vol11/iss1/2/ |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|