18 citations · 46 across the 68 of their papers we have counts for
7 papers · 1 filter
Bounding the Mostar index
Štefko Miklavič, Johannes Pardey, Dieter Rautenbach +1
Došlić et al. defined the Mostar index of a graph as , where, for an edge of , the term denotes the number…
Maximizing the Mostar index for bipartite graphs and split graphs
Štefko Miklavič, Johannes Pardey, Dieter Rautenbach +1
Došlić et al.~defined the Mostar index of a graph as , where, for an edge of , the term denotes the number of ve…
Majority Edge-Colorings of Graphs
Felix Bock, Rafał Kalinowski, Johannes Pardey +3
We propose the notion of a majority -edge-coloring of a graph , which is an edge-coloring of with colors such that, for every vertex of , at most half the edge…
Relating the independence number and the dissociation number
Felix Bock, Johannes Pardey, Lucia D. Penso +1
The independence number and the dissociation number of a graph are the largest orders of induced subgraphs of of maximum degree at most and at mo…
Efficiently recognizing graphs with equal independence and annihilation numbers
Johannes Rauch, Dieter Rautenbach
The annihilation number of a graph is an efficiently computable upper bound on the independence number of . Recently, Hiller observed that a characterization o…
A bound on the dissociation number
Felix Bock, Johannes Pardey, Lucia D. Penso +1
The dissociation number of a graph is the maximum order of a set of vertices of inducing a subgraph that is of maximum degree at most . Computing the dis…