Exponential independence in subcubic graphs

From MaRDI portal



Abstract: A set S of vertices of a graph G is exponentially independent if, for every vertex u in S, sumlimits_{vin Ssetminus { u}}left(frac{1}{2} ight)^{{ m dist}_{(G,S)}(u,v)-1}<1, where mdist(G,S)(u,v) is the distance between u and v in the graph G−(Ssetminusu,v). The exponential independence number alphae(G) of G is the maximum order of an exponentially independent set in G. 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 n have exponentially independent sets of order Omega(n/log2(n)), that the infinite cubic tree has no exponentially independent set of positive density, and that subcubic trees of order n have exponentially independent sets of order (n+3)/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)