7 citations · 10 across the 9 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2019
Robustness: a New Form of Heredity Motivated by Dynamic Networks
Arnaud Casteigts, Swan Dubois, Franck Petit +1
We investigate a special case of hereditary property in graphs, referred to as {\em robustness}. A property (or structure) is called robust in a graph if it is inherited by all…
cs.DM2009
Spanning Trees of Bounded Degree Graphs
John Michael Robson
We consider lower bounds on the number of spanning trees of connected graphs with degree bounded by . The question is of interest because such bounds may improve the analysis of…