8 citations · 8 across the 1 of their papers we have counts for
3 papers
math.CO2019
The maximum average connectivity among all orientations of a graph
Rocio M. Casablanca, Peter Dankelmann, Wayne Goddard +2
For distinct vertices and in a graph , the {\em connectivity} between and , denoted , is the maximum number of internally disjoint -- paths in …
math.CO2018
On the roots of Wiener polynomials of graphs
Jason I. Brown, Ortrud Oellermann, Lucas Mol
The Wiener polynomial of a connected graph is defined as , where denotes the distance between and , and the sum is taken over all unorde…
math.CO2017★ 8 cited
On the Mean Connected Induced Subgraph Order of Cographs
Matthew E. Kroeker, Lucas Mol, Ortrud R. Oellermann
In this article the extremal structures for the mean order of connected induced subgraphs of cographs are determined. It is shown that among all connected cographs of order $n \ge…