Supereulerian Graphs with Constraints on the Matching Number and Minimum Degree
Sign Up to like & getrecommendations! Published in 2021 at "Graphs and Combinatorics"
DOI: 10.1007/s00373-020-02229-x
Abstract: A graph is supereulerian if it has a spanning eulerian subgraph. We show that a connected simple graph G with $$n = |V(G)| \ge 2$$ n = | V ( G ) | ≥ 2… read more here.
Keywords: graphs; graphs constraints; constraints matching; graph ... See more keywords
Lower Bounds of Distance Laplacian Spectral Radii of n-Vertex Graphs in Terms of Fractional Matching Number
Sign Up to like & getrecommendations! Published in 2021 at "Journal of the Operations Research Society of China"
DOI: 10.1007/s40305-021-00358-5
Abstract: A fractional matching of a graph G is a function f: $$E(G)\rightarrow [0, 1]$$ such that for each vertex v, $$\sum \nolimits _{e \epsilon \Gamma _G (v)}f(e)\hbox {\,\,\char 054\,\,}1$$ . The fractional matching number of… read more here.
Keywords: distance laplacian; fractional matching; laplacian spectral; matching number ... See more keywords
Lower bounds of graph energy in terms of matching number
Sign Up to like & getrecommendations! Published in 2018 at "Linear Algebra and its Applications"
DOI: 10.1016/j.laa.2018.03.040
Abstract: Abstract The energy E ( G ) of a graph G is the sum of the absolute values of all eigenvalues of G . We are interested in the relation between the energy of a… read more here.
Keywords: bounds graph; energy; number; lower bounds ... See more keywords
Antichains, the stick principle, and a matching number
Sign Up to like & getrecommendations! Published in 2019 at "Topology and its Applications"
DOI: 10.1016/j.topol.2019.01.013
Abstract: Abstract We investigate basic properties of three cardinal invariants involving ω 1 : stick, antichain number, and matching number. The antichain number is the least cardinal κ for which there does not exist a subcollection… read more here.
Keywords: antichains stick; number; matching number; stick principle ... See more keywords