Johannes Pardey

activity

20202023

most citedMaximizing the Mostar index for bipartite graphs and split graphs

2 citations · 3 across the 10 of their papers we have counts for

collaborators

11 papers

math.CO2022★ 1 cited

Bounding the Mostar index

Štefko Miklavič, Johannes Pardey, Dieter Rautenbach +1

Došlić et al. defined the Mostar index of a graph $G$ as $M o (G) = uv \in E (G) \sum ∣ n_{G} (u, v) - n_{G} (v, u) ∣$ , where, for an edge $uv$ of $G$ , the term $n_{G} (u, v)$ denotes the number…

math.CO2022★ 2 cited

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 $G$ as $uv \in E (G) \sum ∣ n_{G} (u, v) - n_{G} (v, u) ∣$ , where, for an edge $uv$ of $G$ , the term $n_{G} (u, v)$ denotes the number of ve…

math.CO2022

Majority Edge-Colorings of Graphs

Felix Bock, Rafał Kalinowski, Johannes Pardey +3

We propose the notion of a majority $k$ -edge-coloring of a graph $G$ , which is an edge-coloring of $G$ with $k$ colors such that, for every vertex $u$ of $G$ , at most half the edge…

math.CO2022

Relating the independence number and the dissociation number

Felix Bock, Johannes Pardey, Lucia D. Penso +1

The independence number $α (G)$ and the dissociation number $diss (G)$ of a graph $G$ are the largest orders of induced subgraphs of $G$ of maximum degree at most $0$ and at mo…

math.CO2022

A bound on the dissociation number

Felix Bock, Johannes Pardey, Lucia D. Penso +1

The dissociation number $diss (G)$ of a graph $G$ is the maximum order of a set of vertices of $G$ inducing a subgraph that is of maximum degree at most $1$ . Computing the dis…

math.CO2022

Relating dissociation, independence, and matchings

Felix Bock, Johannes Pardey, Lucia D. Penso +1

A dissociation set in a graph is a set of vertices inducing a subgraph of maximum degree at most $1$ . Computing the dissociation number $diss (G)$ of a given graph $G$ , define…