Sign Up to like & get
recommendations!
3
Published in 2022 at "Discrete Mathematics"
DOI: 10.1016/j.disc.2022.112885
Abstract: 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…
read more here.
Keywords:
maximum degree;
acyclic matchings;
graphs bounded;
bounded maximum ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2021 at "Linear Algebra and its Applications"
DOI: 10.1016/j.laa.2020.06.004
Abstract: Abstract A perfect matching in a graph G is a set of disjoint edges covering all vertices of G. Let ρ ( G ) be the spectral radius of a graph G, and let θ…
read more here.
Keywords:
matchings graphs;
spectral radius;
radius matchings;
perfect matching ... See more keywords