Results 31 to 40 of about 629,769 (266)

On the Number of k-Matchings in Graphs

Proceedings of the National Academy of Sciences, India Section A: Physical Sciences, 2022
Suppose $G$ is a undirected simple graph. A $k-$subset of edges in $G$ without common vertices is called a $k-$matching and the number of such subsets is denoted by $p(G,k)$. The aim of this paper is to present exact formulas for $p(G,3)$, $p(G,4)$ and $P(G,5)$ in terms of some degree-based invariants.
Kinkar Chandra Das, Ali Ghalavand, Ali Reza Ashrafi   +2 more
openaire   +2 more sources

Estimating the number of principal components via Split-Half Eigenvector Matching (SHEM)

MethodsX, 2023
Estimating the number of principal components to retain for dimension reduction is a critical step in many applications of principal component analysis. Common methods may not be optimal, however.
Thomas E. Gladwin
doaj   +1 more source

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
Cranston, Daniel W., Kinnersley, William B., O, Suil, West, Douglas B.   +3 more
openaire   +2 more sources

On the Number of Group-Weighted Matchings [PDF]

Journal of Algebraic Combinatorics, 1998
Let \(G\) be a bipartite graph with bipartition \(\{A, B\}\), where \(| A| = | B| \). Let \(K\) be a finite abelian group with \(k\) elements, and let \(w : E(G) \rightarrow K\) be a weight assignment on the edges of \(G\). For a subset \(S\) of the edge set of \(G\), let \(w(S)\) denote the product of the weights of the edges in \(S\).
Kahn, Jeff, Meshulam, Roy
openaire   +1 more source

Ramsey Number of a Connected Triangle Matching [PDF]

Journal of Graph Theory, 2015
AbstractWe determine the 2‐color Ramsey number of a connected triangle matching that is any connected graph containing n vertex disjoint triangles. We obtain that , somewhat larger than in the classical result of Burr, Erdős, and Spencer for a triangle matching, . The motivation is to determine the Ramsey number of the square of a cycle .
Sárközy, Gábor, Gyárfás, András
openaire   +4 more sources

Exploring Preferences for a Digital Single‐Session Intervention for Adolescent Siblings of Youth With Cancer

Pediatric Blood &Cancer, EarlyView.
ABSTRACT Introduction Adolescent siblings of children with cancer are at elevated risk for psychosocial problems. Unfortunately, various barriers such as limited family time and resources, conflicting schedules, and psychosocial staffing constraints at cancer centers hinder sibling access to support.
Christina M. Amaro, Sarah Silver, Prishi Patel, Meredith K. Reffner Collins, Kimberly S. Canter, Stephanie Fooks‐Parker, Michael Amylon, Shawna V. Hudson, Jessica L. Schleider, Melissa A. Alderfer, Katie A. Devine   +10 more
wiley   +1 more source

The eccentric harmonic index of trees

AKCE International Journal of Graphs and Combinatorics
Topological indices play an important role in mathematical chemistry, particularly in studies of quantitative structure property and quantitative structure activity relationships.
Yueping Su, Lieying Liao, Shaoqiang Liu
doaj   +1 more source

Mapping the evolution of mitochondrial complex I through structural variation

FEBS Letters, EarlyView.
Respiratory complex I (CI) is crucial for bioenergetic metabolism in many prokaryotes and eukaryotes. It is composed of a conserved set of core subunits and additional accessory subunits that vary depending on the organism. Here, we categorize CI subunits from available structures to map the evolution of CI across eukaryotes. Respiratory complex I (CI)
Dong‐Woo Shin, Tingting Chen, James A. Letts   +2 more
wiley   +1 more source

Organoids in pediatric cancer research

FEBS Letters, EarlyView.
Organoid technology has revolutionized cancer research, yet its application in pediatric oncology remains limited. Recent advances have enabled the development of pediatric tumor organoids, offering new insights into disease biology, treatment response, and interactions with the tumor microenvironment.
Carla Ríos Arceo, Jarno Drost
wiley   +1 more source

Graphs with Total Domination Number Double of the Matching Number

Journal of New Theory
A subset $S$ of vertices of a graph $G$ with no isolated vertex is called a total dominating set of $G$ if each vertex of $G$ has at least one neighbor in the set $S$.
Selim Bahadır
doaj   +1 more source