Results 11 to 20 of about 217,204 (287)
Combinatorial Speculations and the Combinatorial Conjecture for Mathematics [PDF]
arXiv, 2006 19 pages with 6 ...
openaire +3 more sources
An experimental mathematics approach to several combinatorial problems [PDF]
arXiv: Combinatorics, 2020 Dissertation.
openaire +3 more sources
Uniqueness of radiomic features in non‐small cell lung cancer
Journal of Applied Clinical Medical Physics, Volume 23, Issue 12, December 2022., 2022 Abstract Purpose The uniqueness of radiomic features, combined with their reproducibility, determines the reliability of radiomic studies. This study is to test the hypothesis that radiomic features extracted from a defined region of interest (ROI) are unique to the underlying structure (e.g., tumor). Approach Two cohorts of non‐small cell lung cancer (
Gary Ge, Jie Zhang
wiley +1 more source
Multiple sclerosis clinical decision support system based on projection to reference datasets
Annals of Clinical and Translational Neurology, Volume 9, Issue 12, Page 1863-1873, December 2022., 2022 Abstract Objective Multiple sclerosis (MS) is a multifactorial disease with increasingly complicated management. Our objective is to use on‐demand computational power to address the challenges of dynamically managing MS. Methods A phase 3 clinical trial data (NCT00906399) were used to contextualize the medication efficacy of peg‐interferon beta‐1a vs ...
Chadia Ed‐driouch +13 more
wiley +1 more source
Locating-Chromatic Number of Amalgamation of Stars
Journal of Mathematical and Fundamental Sciences, 2013 Let G be a connected graph and c a proper coloring of G . For i Æ’1,2,Æ’»,k define the color class i C as the set of vertices receiving color i . The color code c (v) "ž¨ of a vertex v in G is the ordered k -tuple 1 ( ( , ), , ( , )) k d v C Æ’» d v C ...
Asmiati Asmiati +2 more
doaj +1 more source
A method to construct graphs with certain partition dimension
Electronic Journal of Graph Theory and Applications, 2019 In this paper, we propose a method for constructing new graphs from a given graph G so that the resulting graphs have the partition dimension at most one larger than the partition dimension of the graph G.
Debi Oktia Haryeni +2 more
doaj +1 more source
On size multipartite Ramsey numbers for stars versus paths and cycles
Electronic Journal of Graph Theory and Applications, 2017 Let $K_{l\times t}$ be a complete, balanced, multipartite graph consisting of $l$ partite sets and $t$ vertices in each partite set. For given two graphs $G_1$ and $G_2$, and integer $j\geq 2$, the size multipartite Ramsey number $m_j(G_1,G_2)$ is the ...
Anie Lusiani +2 more
doaj +1 more source
On the restricted size Ramsey number for P3 versus dense connected graphs
Electronic Journal of Graph Theory and Applications, 2020 Let F, G and H be simple graphs. A graph F is said a (G,H)-arrowing graph if in any red-blue coloring of edges of F we can find a red G or a blue H. The size Ramsey number of G and H, ŕ(G,H), is the minimum size of F.
Denny Riama Silaban +2 more
doaj +1 more source
Modular Irregular Labeling on Double-Star and Friendship Graphs
Journal of Mathematics, 2021 A modular irregular graph is a graph that admits a modular irregular labeling. A modular irregular labeling of a graph G of order n is a mapping of the set of edges of the graph to 1,2,…,k such that the weights of all vertices are different.
K. A. Sugeng +3 more
doaj +1 more source
A short proof of Combinatorial Nullstellensatz [PDF]
American Mathematical Monthly, vol. 117, no 9 (2010), 821-823, 2009 In this note we give a short, direct proof of the well known Combinatorial Nullstellensatz.
arxiv +1 more source