Results 61 to 70 of about 20,650,729 (303)
图的补距离矩阵谱半径的最大值(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
当匹配数很小时具有最小拉普拉斯谱半径的树(Trees with small matching number and minimum Laplacian spectral radius)
Zhejiang Daxue xuebao. Lixue ban, 2013 考虑了具有最小拉普拉斯谱半径的树的问题.并确定了当匹配数很小时具有最小拉普拉斯谱半径的树.
LINXi-qin(林西芹) +2 more
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
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
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
Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
Linear Algebra and its Applications, 2019 A signed graph ( G , σ ) is a graph with a sign attached to each of its edges, where G is the underlying graph of ( G , σ ) . Let m ( G ) , c ( G ) and r ( G , σ ) be the matching number, the cyclomatic number and the rank of the adjacency matrix of ( G ,
Sheng-Jie He +2 more
semanticscholar +1 more source
A Ramsey-type theorem for the matching number regarding connected graphs [PDF]
Discrete Mathematics, 2018 A major line of research is discovering Ramsey-type theorems, which are results of the following form: given a graph parameter $\rho$, every graph $G$ with sufficiently large $\rho(G)$ contains a `well-structured' induced subgraph $H$ with large $\rho(H)$
Ilkyoo Choi +3 more
semanticscholar +1 more source
On the number of matchings of a tree
European Journal of Combinatorics, 2007 The author obtains explicit expressions for the average number of \(k\)-matchings and the average number of maximal matchings of size \(k\) in rooted ordered trees, labelled trees, and \(s\)-ary trees with \(n\) vertices; and he derives asymptotic expressions for the average total number of maximum matchings in rooted ordered trees, labelled trees, and
openaire +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
Capturing Topology in Graph Pattern Matching [PDF]
, 2011 Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been considered instead.
Huai, Jinpeng +9 more
core +1 more source