Results 1 to 10 of about 629,769 (266)
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
The matching number and Hamiltonicity of graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 The matching number of a graph G is the size of a maximum matching in the graph. In this note, we present a sufficient condition involving the matching number for the Hamiltonicity of graphs.
Rao Li
doaj +3 more sources
CNpare: matching DNA copy number profiles [PDF]
Bioinformatics, 2021 AbstractSelecting the optimal cancer cell line for an experiment can be challenging given the diversity of lines available. Cell lines are often chosen based on their tissue of origin, however, the results of large-scale pan-cancer studies suggest that matching lines based on molecular features may be more appropriate. Existing approaches are available
Blas Chaves-Urbano +3 more
openaire +2 more sources
Discontinuity and diversity of Persian scientific research journals in the field of educational sciences by using coloring and mathematical algebraic parameters [PDF]
ریاضی و جامعه, 2022 The aim of the current research is to study and compare graphs authorship by Iranian researchers in Persian scientific research journals in the field of educational sciences by using algebraic parameters of mathematics. In this research, the data related
Ali Abdi, Mostafa Amini
doaj +1 more source
Mathematics, 2022 A two-mode network is a type of network in which nodes can be divided into two sets in such a way that links can be established between different types of nodes. The relationship between two separate sets of entities can be modeled as a bipartite network.
Ali Al Khabyah +4 more
doaj +1 more source
Bounds on the Minimum Edge Dominating Energy in Terms of Some Parameters of a Graph [PDF]
Mathematics Interdisciplinary Research, 2023 The minimum edge dominating energy, denoted by $EE_{F}(G)$, is the sum of the absolute values of eigenvalues of the minimum edge dominating matrix of graph $G$.
Fateme Movahedi
doaj +1 more source
Extremal Graphs for Sombor Index with Given Parameters
Axioms, 2023 In this paper, we present the upper and lower bounds on Sombor index SO(G) among all connected graphs (respectively, connected bipartite graphs). We give some sharp lower and upper bounds on SO(G) among connected graphs in terms of some parameters ...
Wanping Zhang, Jixiang Meng, Na Wang
doaj +1 more source
A note on the size Ramsey numbers for matchings versus cycles [PDF]
Mathematica Bohemica, 2021 For graphs $G$, $F_1$, $F_2$, we write $G \rightarrow(F_1, F_2)$ if for every red-blue colouring of the edge set of $G$ we have a red copy of $F_1$ or a blue copy of $F_2$ in $G$.
Edy Tri Baskoro, Tomáš Vetrík
doaj +1 more source
New Results Relating Independence and Matchings
Discussiones Mathematicae Graph Theory, 2022 In this paper we study relationships between the matching number, written µ(G), and the independence number, written α(G).
Caro Yair, Davila Randy, Pepper Ryan
doaj +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 ...
Hirano, Ayana, Matsuda, Kazunori
openaire +3 more sources