•  
  •  

Home > Journals > TAG > Vol. 11 > Iss. 1 (2024)

 

Publication Date

March 2024

Abstract

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 sufficient conditions for the graph produced by the construction to be strongly $i$-bicritical are given. The strongly $i$-bicritical graphs with independent domination number $i(G) = 3$ are characterized, and it is shown that the strongly $i$-bicritical graphs with independent domination number $i(G) \geq 5$ may be hard to characterize. It is shown that every strongly $i$-bicritical graph has minimum degree 3 and is 2-connected. Further, the vertices in any 2-vertex cut must be adjacent. The diameter of a strongly $i$-bicritical graph $G$ is shown to be at most $3i(G) / 2 + 2$.

Creative Commons License

Creative Commons Attribution 4.0 License
This work is licensed under a Creative Commons Attribution 4.0 License.

Additional Files
ref_tag_2024_11_01_02.pdf (115 kB)
Supplemental Reference List
Download

Additional files available below

Share

COinS