Results 21 to 30 of about 629,769 (266)
On Graphs with Induced Matching Number Almost Equal to Matching Number
Electronic Notes in Discrete Mathematics, 2015 Abstract Kobler and Rotics in 2003, and Cameron and Walker in 2005, gave a complete structural description of the graphs G where the matching number ν ( G ) equals the induced matching number ν 2 ( G ) . We study their result and use it to analyse graphs G with ν ( G ) − ν 2 ( G ) ≤ k .
Marcio Antônio Duarte +4 more
openaire +1 more source
The Regularity of Edge Rings and Matching Numbers
Mathematics, 2020 Let K [ G ] denote the edge ring of a finite connected simple graph G on [ d ] and mat ( G ) the matching number of G. It is shown that reg ( K [ G ] ) ≤ mat ( G ) if G is non-bipartite and K [ G ] is normal,
Jürgen Herzog, Takayuki Hibi
doaj +1 more source
Binding Number, Toughness and General Matching Extendability in Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 A connected graph $G$ with at least $2m + 2n + 2$ vertices which contains a perfect matching is $E(m, n)$-{\it extendable}, if for any two sets of disjoint independent edges $M$ and $N$ with $|M| = m$ and $|N|= n$, there is a perfect matching $F$ in $G ...
Hongliang Lu, Qinglin Yu
doaj +1 more source
Journal of Mathematics, 2022 The matching roots of a simple connected graph G are the roots of the matching polynomial which is defined as MGx=∑k=0n/2−1kmG,kxn−2k, where mG,k is the number of the k matchings of G. Let λ1G denote the largest matching root of the graph G.
Luozhong Gong, Weijun Liu
doaj +1 more source
图的补距离矩阵谱半径的最大值(On maximal spectral radius of complementary distance matrix of graphs)
Zhejiang Daxue xuebao. Lixue ban, 2013 We determine the graphs with maximal spectral radius of the complementary distance matrix among simple connected graphs with fixed order and matching number and diameter less than or equal to 2.
SULi(苏莉), LIHong-hai(李红海)
doaj +1 more source
LOCK-FREE MULTITHREADED SEMI-GLOBAL MATCHING WITH AN ARBITRARY NUMBER OF PATH DIRECTIONS [PDF]
ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2020 This paper describes an efficient implementation of the semi-global matching (SGM) algorithm on multi-core processors that allows a nearly arbitrary number of path directions for the cost aggregation stage.
D. Frommholz
doaj +1 more source
Matching residency numbers to the workforce needs [PDF]
Current Reviews in Musculoskeletal Medicine, 2014 Matching the number of surgeons to the demands for orthopedic services has been notoriously difficult. Not only does one need to evaluate current trends in the supply and provision of services but anticipate the impact of future reforms on these variables. The British Orthopaedic Association has aspired to provide consultant to population ratio of 1:15,
S, Khan +4 more
openaire +2 more sources
当匹配数很小时具有最小拉普拉斯谱半径的树(Trees with small matching number and minimum Laplacian spectral radius)
Zhejiang Daxue xuebao. Lixue ban, 2013 考虑了具有最小拉普拉斯谱半径的树的问题.并确定了当匹配数很小时具有最小拉普拉斯谱半径的树.
LINXi-qin(林西芹) +2 more
doaj +1 more source
On the Independence Number of Traceable 2-Connected Claw-Free Graphs
Discussiones Mathematicae Graph Theory, 2019 A well-known theorem by Chvátal-Erdőos [A note on Hamilton circuits, Discrete Math. 2 (1972) 111–135] states that if the independence number of a graph G is at most its connectivity plus one, then G is traceable.
Wang Shipeng, Xiong Liming
doaj +1 more source
Fractional matching preclusion for generalized augmented cubes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 The \emph{matching preclusion number} of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings.
Tianlong Ma +3 more
doaj +1 more source