Results 41 to 50 of about 13,294,177 (308)
Annals of Oncology, 2021 BACKGROUND A multi-cancer early detection (MCED) test used to complement existing screening could increase the number of cancers detected through population screening, potentially improving clinical outcomes. The Circulating Cell-free Genome Atlas study (
E. Klein +14 more
semanticscholar +1 more source
On the number of maximum independent sets of graphs [PDF]
Transactions on Combinatorics, 2014 Let $G$ be a simple graph. An independent set is a set of pairwise non-adjacent vertices. The number of vertices in a maximum independent set of $G$ is denoted by $alpha(G)$. In this paper, we characterize graphs $G$ with $n$ vertices and with maximum
Tajedin Derikvand, Mohammad Reza Oboudi
doaj
An independent set degree condition for fractional critical deleted graphs
Discrete and Continuous Dynamical Systems. Series A, 2019 Let \begin{document}$i≥2$ \end{document} , \begin{document}$Δ≥0$ \end{document} , \begin{document}$1≤ a≤ b-Δ$ \end{document} , \begin{document}$n>\frac{(a+b)(ib+2m-2)}{a}+n'$ \end{document} and \begin{document}$δ(G)≥\frac{b^{2}}{a}+n'+2m$ \end{document} ,
Wei Gao +3 more
semanticscholar +1 more source
Edge Metric Dimension and Edge Basis of One-Heptagonal Carbon Nanocone Networks
IEEE Access, 2022 A molecular (chemical) graph is a simple connected graph, where the vertices represent the compound’s atoms and the edges represent bonds between the atoms, and the degree (valence) of every vertex (atom) is not more than four.
Karnika Sharma +2 more
doaj +1 more source
Discrete and Continuous Dynamical Systems. Series A, 2019 The problem of data transmission in communication network can betransformed into the problem of fractional factor existing in graph theory. Inrecent years, the data transmission problem in the specificnetwork conditions has received a great deal of ...
Wei Gao, D. Dimitrov, H. Abdo
semanticscholar +1 more source
Max-independent set and the quantum alternating operator ansatz
, 2020 The maximum independent set (MIS) problem of graph theory using the quantum alternating operator ansatz is studied. We perform simulations on the Rigetti Forest simulator for the square ring, $K_{2,3}$, and $K_{3,3}$ graphs and analyze the dependence of ...
Zain Saleem
semanticscholar +1 more source
Edge Estimation with Independent Set Oracles [PDF]
Information Technology Convergence and Services, 2017 We study the task of estimating the number of edges in a graph, where the access to the graph is provided via an independent set oracle. Independent set queries draw motivation from group testing and have applications to the complexity of decision versus
P. Beame +4 more
semanticscholar +1 more source
Independent Sets In Association Schemes [PDF]
Combinatorica, 2006 15 pages; This is the corrected version that will appear in ...
Chris D. Godsil, Michael W. Newman
openaire +2 more sources
Making a Dominating Set of a Graph Connected
Discussiones Mathematicae Graph Theory, 2018 Let G = (V,E) be a graph and S ⊆ V. We say that S is a dominating set of G, if each vertex in V \ S has a neighbor in S. Moreover, we say that S is a connected (respectively, 2-edge connected or 2-connected) dominating set of G if G[S] is connected ...
Li Hengzhe, Wu Baoyindureng, Yang Weihua
doaj +1 more source
Minimum Neighborhood of Alternating Group Graphs
IEEE Access, 2019 The minimum neighborhood and combinatorial property are two important indicators of fault tolerance of a multiprocessor system. Given a graph G, θG(q) is the minimum number of vertices adjacent to a set of q vertices of G (1 ≤ q ≤ |V(
Yanze Huang +3 more
doaj +1 more source