4 papers · 1 filter
Leaf to leaf path lengths in trees of given degree sequence
Dieter Rautenbach, Johannes Scherer, Florian Werner
For a tree , let be the number of different lengths of leaf to leaf paths in . For a degree sequence of a tree, let be the minimum radius of a tree…
Coloring by Pushing Vertices
Dieter Rautenbach, Laurin Schwartze, Florian Werner
Let be a graph of order , maximum degree at most , and no component of order . Inspired by the famous 1-2-3-conjecture, Bensmail, Marcille, and Orenga define a proper…
An Optimization Approach to Degree Deviation and Spectral Radius
Dieter Rautenbach, Florian Werner
For a finite, simple, and undirected graph with vertices and average degree , Nikiforov introduced the degree deviation of as $s=\sum_{u\in V(G)}\left|d_G(u)-d\right…
Degree Deviation and Spectral Radius
Dieter Rautenbach, Florian Werner
For a finite, simple, and undirected graph with vertices, edges, and largest eigenvalue , Nikiforov introduced the degree deviation of as $s=\sum_{u\in V(G)}\le…