8 citations · 10 across the 3 of their papers we have counts for
5 papers
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 …
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…
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…
Global properties of graphs with local degree conditions
E. Kubicka, G. Kubicki, O. R. Oellermann
Let P be a graph property. A graph is locally P if the subgraph induced by the open neighbourhood of every vertex has property P. A graph has the Dirac condition if the minimum deg…
m_3^3-Convex geometries are A-free
J. Cáceres, O. R. Oellermann, M. L. Puertas
Let V be a finite set and M a collection of subsets of V. Then M is an alignment of V if and only if M is closed under taking intersections and contains both V and the empty set. I…