O. Oellermann

activity

20112021

most citedThe Simultaneous Metric Dimension of Graph Families

28 citations · 52 across the 10 of their papers we have counts for

collaborators

Showing 2018Show all

3 papers · 1 filter

math.CO2018★ 10 cited

On the Mean Order of Connected Induced Subgraphs of Block Graphs

Kristaps J. Balodis, Matthew E. Kroeker, Lucas Mol +1

The average order of the connected induced subgraphs of a graph $G$ is called the mean connected induced subgraph (CIS) order of $G$ . This is an extension of the mean subtree order…

math.CO2018

Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs

Rocío M. Casablanca, Lucas Mol, Ortrud R. Oellermann

Let $G$ be a (multi)graph of order $n$ and let $u, v$ be vertices of $G$ . The maximum number of internally disjoint $u$ - $v$ paths in $G$ is denoted by $κ_{G} (u, v)$ , and the maximum nu…

math.CO2018

On the roots of Wiener polynomials of graphs

Jason I. Brown, Ortrud Oellermann, Lucas Mol

The Wiener polynomial of a connected graph $G$ is defined as $W (G; x) = \sum x^{d (u, v)}$ , where $d (u, v)$ denotes the distance between $u$ and $v$ , and the sum is taken over all unorde…