Results 71 to 80 of about 20,650,729 (303)
The number of maximum matchings in a tree
Discrete Mathematics, 2011 38 ...
Heuberger C., Wagner S.
openaire +6 more sources
Game matching number of graphs
Discrete Applied Mathematics, 2013 We study a competitive optimization version of $α'(G)$, the maximum size of a matching in a graph $G$. Players alternate adding edges of $G$ to a matching until it becomes a maximal matching. One player (Max) wants that matching to be large; the other (Min) wants it to be small. The resulting sizes under optimal play when Max or Min starts are denoted $
Daniel W. Cranston +3 more
openaire +2 more sources
On the Linear Number of Matching Substrings [PDF]
J. Univers. Comput. Sci., 2010 JUCS - Journal of Universal Computer Science Volume Nr.
openaire +1 more source
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Chronic micro‐inflammation in patients with end‐stage renal disease (ESRD) is a significant driver of cardiovascular complications and diminished quality of life. While standard hemodialysis (SHD) effectively manages small‐molecule clearance, its ability to remove medium‐to‐large uremic toxins—the primary catalysts of systemic ...
Hongwei Zuo +5 more
wiley +1 more source
Chordal circulant graphs and induced matching number [PDF]
Discrete Mathematics, 2018 Let $G=C_{n}(S)$ be a circulant graph on $n$ vertices. In this paper we characterize chordal circulant graphs and then we compute $\nu (G)$, the induced matching number of $G$. These latter are useful in bounding the Castelnuovo-Mumford regularity of the
F. Romeo
semanticscholar +1 more source
On the approximability of the maximum induced matching problem [PDF]
, 2005 In this paper we consider the approximability of the maximum induced matching problem (MIM). We give an approximation algorithm with asymptotic performance ratio <i>d</i>-1 for MIM in <i>d</i>-regular graphs, for each <i>d ...
Zito, Michele +12 more
core +1 more source
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Introduction Peritoneal dialysis (PD) is an established home‐based kidney replacement therapy (KRT), but its uptake remains low in Japan. We evaluated whether individualized education in a dedicated outpatient clinic was associated with the initiation of PD.
Yasuko Ito +7 more
wiley +1 more source
Energy, matching number and odd cycles of graphs
Linear Algebra and its Applications, 2019 The energy E ( G ) of a graph G is the sum of the absolute values of the eigenvalues of the adjacency matrix of G. Wong et al. (2018) [11] proved that E ( G ) ≥ 2 ν ( G ) where ν ( G ) denotes the matching number of G.
F. Ashraf
semanticscholar +1 more source
On the Chromatic Number of Matching Kneser Graphs [PDF]
Combinatorics, Probability and Computing, 2019 AbstractIn an earlier paper, the present authors (2015) introduced thealtermatic numberof graphs and used Tucker’s lemma, an equivalent combinatorial version of the Borsuk–Ulam theorem, to prove that the altermatic number is a lower bound for chromatic number.
Meysam Alishahi, Hossein Hajiabolhassan
openaire +3 more sources
Residual Closeness, Matching Number and Chromatic Number
The Computer Journal, 2022 Abstract Residual closeness is a novel graph-based network vulnerability parameter. In this model, links are perfectly reliable and the nodes fail independently of each other. We characterize those graphs with maximum residual closeness and those connected graphs with minimum residual closeness when matching number (chromatic number ...
Yanna Wang, Bo Zhou 0007
openaire +2 more sources