Results 51 to 60 of about 20,650,729 (303)
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
Ultra-high throughput string matching for deep packet inspection [PDF]
, 2010 Deep Packet Inspection (DPI) involves searching a packet's header and payload against thousands of rules to detect possible attacks. The increase in Internet usage and growing number of attacks which must be searched for has meant hardware acceleration ...
Wang, Xiaojun +3 more
core +3 more sources
Matching preclusion number of graphs [PDF]
Theoretical Computer Science, 2019 23 ...
Zhao Wang 0007 +3 more
openaire +2 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
The asymptotic induced matching number of hypergraphs: balanced binary strings [PDF]
Electronic Journal of Combinatorics, 2019 We compute the asymptotic induced matching number of the $k$-partite $k$-uniform hypergraphs whose edges are the $k$-bit strings of Hamming weight $k/2$, for any large enough even number $k$.
Srinivasan Arunachalam +2 more
semanticscholar +1 more source
Bipartite rainbow numbers of matchings
Discrete Mathematics, 2009 8 ...
Xueliang Li 0001, Jianhua Tu, Zemin Jin
openaire +4 more sources
Hausdorff-Distance Enhanced Matching of Scale Invariant Feature Transform Descriptors in Context of Image Querying [PDF]
, 2012 Reliable and effective matching of visual descriptors is a key step for many vision applications, e.g. image retrieval. In this paper, we propose to integrate the Hausdorff distance matching together with our pairing algorithm, in order to obtain a ...
D. Wilson +3 more
core +1 more source
Matching Numbers and Dimension of Edge Ideals [PDF]
Graphs and Combinatorics, 2021 Let $G$ be a finite simple graph on the vertex set $V(G) = \{x_{1}, \ldots, x_{n}\}$ and match$(G)$, min-match$(G)$ and ind-match$(G)$ the matching number, minimum matching number and induced matching number of $G$, respectively. Let $K[V(G)] = K[x_{1}, \ldots, x_{n}]$ denote the polynomial ring over a field $K$ and $I(G) \subset K[V(G)]$ the edge ...
Ayana Hirano, Kazunori Matsuda
openaire +4 more sources
Cubic graphs with equal independence number and matching number [PDF]
Discrete Mathematics, 2019 Caro, Davila, and Pepper (arXiv:1909.09093) recently proved $\delta(G) \alpha(G)\leq \Delta(G) \mu(G)$ for every graph $G$ with minimum degree $\delta(G)$, maximum degree $\Delta(G)$, independence number $\alpha(G)$, and matching number $\mu(G ...
Elena Mohr, D. Rautenbach
semanticscholar +1 more source