Results 1 to 10 of about 29,853 (260)

The absolute values of the perfect matching derangement graph's eigenvalues almost follow the lexicographic order of partitions

Discrete Mathematics
In 2013, Ku and Wong showed that for any partitions $μ$ and $μ'$ of a positive integer $n$ with the same first part $u$ and the lexicographic order $μ\triangleleft μ'$, the eigenvalues $ξ_μ$ and $ξ_{μ'}$ of the derangement graph $Γ_n$ have the property $|ξ_μ|\le |ξ_{μ'}|$, where the equality holds if and only if $u=3$ and all other parts are less than $
Fengming Dong, Meiqiao Zhang
exaly   +4 more sources

Conditional Matching Preclusion Number of Graphs

Discrete Dynamics in Nature and Society, 2023
The conditional matching preclusion number of a graph G, denoted by mp1G, is the minimum number of edges whose deletion results in the graph with no isolated vertices that has neither perfect matching nor almost-perfect matching.
Yalan Li, Shumin Zhang, Chengfu Ye
doaj   +2 more sources

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, Yaping Mao, Eddie Cheng, Christopher Melekian   +3 more
doaj   +2 more sources

Almost Perfect Matchings in $k$-Partite $k$-Graphs [PDF]

SIAM Journal on Discrete Mathematics, 2018
The minimum co-degree threshold for a perfect matching in a $k$-graph with $n$ vertices was determined by Rödl, Ruciński and Szemerédi for the case when $n\equiv 0\pmod k$. Recently, Han resolved the remaining cases when $n \not\equiv 0\pmod k$, establishing a conjecture of Rödl, Ruciński and Szemerédi. In this paper, we determine the minimum co-degree
Hongliang Lu, Xingxing Yu
exaly   +4 more sources

Evaluating dental student competency in forensic rugoscopy for human identification [PDF]

Scientific Reports
Rugoscopy is a recognized method for human identification. Its reliability, however, may be compromised when general dentists with limited forensic training perform identification.
Panjit Chunhabundit, Tawepong Arayapisit, Natchalee Srimaneekarn   +2 more
doaj   +2 more sources

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   +2 more sources

Clean pulp versus sterile plastic for mid-stream urine collection: a paired equivalence study comparing the microbiological performance of a novel low carbon collection device with the standard of care [PDF]

BMJ Open
Objectives To determine whether a novel urine collection device (the ‘Pee-in-Pot (PiP)’) produces the same rates of reportable urine culture results as standard of care (SOC) urine collection.
Claire Butler, Andrew Walker, Victoria Welsh, Nicola Lowe, Robert Porter, Peter Harvey, Christopher Ball, Nick Burns-Cox, Joseph B John, Benjamin Holdsworth, Na’el Clarke, Anna Vere, Kazer Lynda, Silifat Yusuf, Valerie Yick, Tracey Doolan, Andrew Mayne, Steve Swann   +17 more
doaj   +2 more sources

Almost color-balanced perfect matchings in color-balanced complete graphs [PDF]

Discrete Mathematics, 2022
For a graph $G$ and a not necessarily proper $k$-edge coloring $c:E(G)\to \{ 1,\ldots,k\}$, let $m_i(G)$ be the number of edges of $G$ of color $i$, and call $G$ {\it color-balanced} if $m_i(G)=m_j(G)$ for every two colors $i$ and $j$. Several famous open problems relate to this notion; Ryser's conjecture on transversals in latin squares, for instance,
Johannes Pardey, Dieter Rautenbach
openaire   +3 more sources

Potential of carpool for network traffic management

International Journal of Transportation Science and Technology, 2022
This study examines the impact of carpool on network traffic in a highly idealized futuristic world, where all travelers are willing to participate in carpool arranged by a Transportation Network Company.
Yu (Marco) Nie, Ruijie Li
doaj   +1 more source

Enhancement of Ultrasonic Transducer Bandwidth by Acoustic Impedance Gradient Matching Layer

Sensors, 2022
High-performance broadband ultrasound transducers provide superior imaging quality in biomedical ultrasound imaging. However, a matching design that perfectly transmits the acoustic energy between the active piezoelectric element and the target medium ...
Ke Zhu, Jinpeng Ma, Xudong Qi, Bingzhong Shen, Yang Liu, Enwei Sun, Rui Zhang   +6 more
doaj   +1 more source