28 citations · 52 across the 10 of their papers we have counts for
4 papers · 1 filter
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…
Global cycle properties in graphs with large minimum clustering coefficient
Adam Borchert, Skylar Nicol, Ortrud R. Oellermann
The clustering coefficient of a vertex in a graph is the proportion of neighbours of the vertex that are adjacent. The minimum clustering coefficient of a graph is the smallest clu…
Global cycle properties in locally isometric graphs
Adam Borchert, Skylar Nicol, Ortrud R. Oellermann
A graph G is locally isometric if the subgraph induced by the neighbourhood of every vertex is an isometric subgraph of G. It is shown that the hamilton cycle problem for locally i…
The Simultaneous Metric Dimension of Graph Families
Y. Ramirez-Cruz, O. R. Oellermann, J. A. Rodriguez-Velazquez
A vertex is said to resolve two vertices and if . A set is said to be a metric generator for if any pair of vertices of …