Andrew Pham

collaborators

2 papers

math.CO2024

Independent Domination of k-Trees

Andrew Pham

Given a simple, finite, nonempty graph $G = (V (G), E (G))$ , a vertex subset $D \subseteq V (G)$ is said to be a dominating set if every vertex $v \in V (G) - D$ is adjacent to a vertex in $D…

math.CO2024

Independent Bondage Number in Graphs under Girth Constraints

E. G. K. M. Gamlath, Andrew Pham, Bing Wei

Given a finite, simple graph $G$ , the independent bondage number of $G$ is the minimum size of an edge set such that its deletion results in a graph with strictly larger independen…