Motivated by a problem in the design of optical networks, we ask when a graph has a spanning spider (subdivision of a star), or, more generally, a spanning tree with a bounded number of branch vertices. We investigate the existence of these spanning subgraphs in analogy to classical studies of Hamiltonicity.
Spanning spiders and light-splitting switches
GARGANO, Luisa;VACCARO, Ugo
2004
Abstract
Motivated by a problem in the design of optical networks, we ask when a graph has a spanning spider (subdivision of a star), or, more generally, a spanning tree with a bounded number of branch vertices. We investigate the existence of these spanning subgraphs in analogy to classical studies of Hamiltonicity.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
