Exponential independence in subcubic graphs
From MaRDI portal
Abstract: A set of vertices of a graph is exponentially independent if, for every vertex in , sumlimits_{vin Ssetminus { u}}left(frac{1}{2}
ight)^{{
m dist}_{(G,S)}(u,v)-1}<1, where is the distance between and in the graph . The exponential independence number of is the maximum order of an exponentially independent set in . In the present paper we present several bounds on this parameter and highlight some of the many related open problems. In particular, we prove that subcubic graphs of order have exponentially independent sets of order , that the infinite cubic tree has no exponentially independent set of positive density, and that subcubic trees of order have exponentially independent sets of order .
Recommendations
Cites work
- Bounds on the exponential domination number
- Domination with exponential decay
- Exponential Domination Critical and Stability in Some Graphs
- Exponential domination in subcubic graphs
- Exponential independence
- Exponential independence number of some graphs
- Hereditary equality of domination and exponential domination
- On exponential domination of \(C_m\times C_n\)
- On exponential domination of some graphs
- Relating domination, exponential domination, and porous exponential domination
Cited in
(4)
This page was built for publication: Exponential independence in subcubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2032859)