Results 31 to 40 of about 10,152,062 (308)
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 .
Márcio Antônio Duarte +4 more
openaire +2 more sources
On the Number of $r$-Matchings in a Tree
The Electronic Journal of Combinatorics, 2017 An $r$-matching in a graph $G$ is a collection of edges in $G$ such that the distance between any two edges is at least $r$. This generalizes both matchings and induced matchings as matchings are $1$-matchings and induced matchings are $2$-matchings. In this paper, we study the minimum and maximum number of $r$-matchings in a tree with fixed order.
Dong Yeap Kang +3 more
openaire +3 more sources
A memetic fingerprint matching algorithm [PDF]
, 2007 Minutiae point pattern matching is the most common approach for fingerprint verification. Although many minutiae point pattern matching algorithms have been proposed, reliable automatic fingerprint verification remains as a challenging problem, both with
Howells, Gareth +3 more
core +1 more source
On matching number, decomposition and representation of well-formed graph
Electronic Journal of Graph Theory and Applications, 2023 In this paper, we find a special type of non-traceable cubic bridge graph called well-formed graph whose central fragment is isomorphic to a hairy cycle and whose branches are pairwise isomorphic.
Alex Ralph Baisa Nieva, Karen P. Nocum
doaj +1 more source
On the Number of $F$-Matchings in a Tree [PDF]
The Electronic Journal of Combinatorics, 2012 We prove that for any integers $k,m>0$ and any tree $F$ with at least one edge, there exists a tree whose number of $F$-matchings is congruent to $k$ modulo $m$ as well as an analogous result for induced $F$-matchings. This answers a question of Alon, Haber and Krivelevich (The number of $F$-matchings in almost every tree is a zero residue, Electron.
openaire +2 more sources
On the equality of the induced matching number and the uniquely restricted matching number for subcubic graphs [PDF]
Theoretical Computer Science, 2020 For a matching $M$ in a graph $G$, let $G(M)$ be the subgraph of $G$ induced by the vertices of $G$ that are incident with an edge in $M$. The matching $M$ is induced, if $G(M)$ is $1$-regular, and $M$ is uniquely restricted, if $M$ is the unique perfect matching of $G(M)$.
Maximilian Fürst, Dieter Rautenbach
openaire +4 more sources
Matching preclusion number of graphs [PDF]
Theoretical Computer Science, 2019 23 ...
Zhao Wang 0007 +3 more
openaire +2 more sources
Bipartite rainbow numbers of matchings
Discrete Mathematics, 2009 8 ...
Xueliang Li 0001, Jianhua Tu, Zemin Jin
openaire +4 more sources
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