Results 61 to 70 of about 308,302 (304)
ON THE CROSSING NUMBER OF THE JOIN OF FIVE VERTEX GRAPH WITH THE DISCRETE GRAPH Dn [PDF]
Acta Electrotechnica et Informatica, 2017 In this paper, we show the values of crossing numbers for join products of graph G on five vertices with the discrete graph Dn and the path Pn on n vertices. The proof is done with the help of software. The software generates all cyclic permutations for
Štefan BEREŽNÝ, Michal STAŠ
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Medication nonadherence during the first 100 days after pediatric hematopoietic stem cell transplantation (HSCT) and during oncology treatment increases risk for complications. BMT4me is a caregiver‐facing mobile health (mHealth) application providing medication reminders, symptom tracking, and note‐taking features to support ...
Micah A. Skeens +4 more
wiley +1 more source
The crossing number of K2,m□Pn [PDF]
, 2008 Investigation of the crossing number of graphs is a classical but very difficult problem. The exact value of the crossing number is known only for a few specific families of graphs.
Zheng, Wenping +2 more
core +1 more source
The Crossing Number of The Hexagonal Graph H3,n
Discussiones Mathematicae Graph Theory, 2019 In [C. Thomassen, Tilings of the torus and the Klein bottle and vertex-transitive graphs on a fixed surface, Trans. Amer. Math. Soc. 323 (1991) 605–635], Thomassen described completely all (except finitely many) regular tilings of the torus S1 and the ...
Wang Jing +2 more
doaj +1 more source
Improvement on the Decay of Crossing Numbers [PDF]
Graphs and Combinatorics, 2008 7 pages, 1 ...
Jakub Cerný +2 more
openaire +4 more sources
Retracing and adjusting edge algorithm for crossing reduction [PDF]
, 2010 碩士「最小化交叉點問題」是指將網路節點配置在平面上，試著去找出一個較佳的配置方式，使得網路連線與連線之間產生的交叉點最少。在許多的應用中，例如Circuit Board Layout、VLSI Circuit Layout、Automated Graph Drawing等，「最小化交叉點問題」一直是相當重要的一環，愈低的交叉點數量，往往代表著愈低的成本。在這篇論文中，我們研究的題目比「最小化交叉點問題」更特定，我們僅討論FLCNP（Fixed Linear Crossing Number Problem）
蕭宏仁; Hsiao, Hung-jen
core
The toroidal crossing number of K4,n [PDF]
, 2009 In this paper, we show that the toroidal crossing number of K4,n, K1,3,n, K2,2,n, K1,1,2,n and K1,1,1,1,n is ⌊n4⌋[2n−4(1+⌊n4⌋)]. In addition, a new lower bound for the toroidal crossing number of Km,n has been obtained. We also discuss about the crossing
Ho, Pak Tung
core +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Introduction Anthracycline‐related cardiac remodeling precedes heart failure in childhood cancer survivors. The objectives of this study were to determine the relationships between patient‐specific factors, moderate‐to‐vigorous physical activity (MVPA), and cardiac remodeling.
Hari K. Narayan +15 more
wiley +1 more source
Exploring the Crossing Numbers of Three Join Products of 6-Vertex Graphs with Discrete Graphs
MathematicsThe significance of searching for edge crossings in graph theory lies inter alia in enhancing the clarity and readability of graph representations, which is essential for various applications such as network visualization, circuit design, and data ...
Michal Staš, Mária Švecová
doaj +1 more source
Mathematics, 2020 The crossing number cr ( G ) of a graph G is the minimum number of edge crossings over all drawings of G in the plane. The main goal of the paper is to state the crossing number of the join product K 2 , 3 + C n for the complete ...
Michal Staš
doaj +1 more source