Zobrazeno 1 - 10
of 111
pro vyhledávání: '"Fürst, Maximilian"'
Studies of the formation of Landau levels based on the Schr\"odinger equation for electrons constrained to curved surfaces have a long history. These include as prime examples surfaces with constant positive and negative curvature, the sphere [Phys.
Externí odkaz:
http://arxiv.org/abs/2307.09221
A matching $M$ in a graph $G$ is acyclic if the subgraph of $G$ induced by the set of vertices that are incident to an edge in $M$ is a forest. We prove that every graph with $n$ vertices, maximum degree at most $\Delta$, and no isolated vertex, has
Externí odkaz:
http://arxiv.org/abs/2002.03649
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
We propose the conjecture that the domination number $\gamma(G)$ of a $\Delta$-regular graph $G$ with $\Delta\geq 1$ is always at most its edge domination number $\gamma_e(G)$, which coincides with the domination number of its line graph. We prove th
Externí odkaz:
http://arxiv.org/abs/1906.10420
The edge domination number $\gamma_e(G)$ of a graph $G$ is the minimum size of a maximal matching in $G$. It is well known that this parameter is computationally very hard, and several approximation algorithms and heuristics have been studied. In the
Externí odkaz:
http://arxiv.org/abs/1905.12241
Autor:
Fürst, Maximilian
If $G(M)$ denotes the subgraph of a graph $G$ induced by the set of vertices that are covered by some matching $M$ in $G$, then $M$ is an induced or a uniquely restricted matching if $G(M)$ is $1$-regular or if $M$ is the unique perfect matching of $
Externí odkaz:
http://arxiv.org/abs/1812.09038
A matching in a graph is induced if no two of its edges are joined by an edge, and finding a large induced matching is a very hard problem. Lin et al. (Approximating weighted induced matchings, Discrete Applied Mathematics 243 (2018) 304-310) provide
Externí odkaz:
http://arxiv.org/abs/1812.05930
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Fürst, Maximilian, Rautenbach, Dieter
A matching $M$ in a graph $G$ is uniquely restricted if no other matching in $G$ covers the same set of vertices. We prove that any connected subcubic graph with $n$ vertices and girth at least $5$ contains a uniquely restricted matching of size at l
Externí odkaz:
http://arxiv.org/abs/1810.04473
A matching $M$ in a graph $G$ is uniquely restricted if no other matching in $G$ covers the same set of vertices. We conjecture that every connected subcubic graph with $m$ edges and $b$ bridges that is distinct from $K_{3,3}$ has a uniquely restrict
Externí odkaz:
http://arxiv.org/abs/1805.00840