SearcharxivSearch

arXiv subjects

Talmage James Reid

Publications and source records attributed to Talmage James Reid.

2 recordsLinked to original sources

Graph Configurations and Independent Bondage Numbers of Planar Graphs

The independent domination number of a finite graph G is the minimum cardinality of an independent dominating set of vertices. The independent bondage number of G is the minimum cardinality of a set of edges whose deletion results in a graph with a larger independent domination number than that of G. In this research, we enhance the existing upper bound on the independent bondage number of a planar graph with a minimum degree of at least three by identifying specific configurations within such planar graphs.

math.CO

Rooted prism-minors and disjoint cycles containing a specified edge

Dirac and Lovász independently characterized the $3$-connected graphs with no pair of vertex-disjoint cycles. Equivalently, they characterized all $3$-connected graphs with no prism-minors. In this paper, we completely characterize the $3$-connected graphs with an edge that is contained in the union of no pair of vertex-disjoint cycles. As applications, we answer the analogous questions for edge-disjoint cycles and for $4$-connected graphs and we completely characterize the $3$-connected graphs with no prism-minor using a specified edge.

math.CO