Results 41 to 50 of about 3,533,009 (320)
Not All Graphs are Segment T-graphs
European Journal of Combinatorics, 1990 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Noga Alon +2 more
openaire +2 more sources
Embedding Graphs into Embedded Graphs [PDF]
Algorithmica, 2020 A (possibly denerate) drawing of a graph $G$ in the plane is approximable by an embedding if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a straight-line drawing of a planar graph $G$ in the plane is approximable by an embedding, can be carried out in polynomial time, if a desired embedding of ...
openaire +5 more sources
THE k-INDEPENDENT GRAPH OF A GRAPH [PDF]
Advances and Applications in Discrete Mathematics, 2017 Let $G=(V,E)$ be a simple graph. A set $I\subseteq V$ is an independent set, if no two of its members are adjacent in $G$. The $k$-independent graph of $G$, $I_k (G)$, is defined to be the graph whose vertices correspond to the independent sets of $G$ that have cardinality at most $k$.
Abdul Jalil M. Khalaf +2 more
openaire +3 more sources
An Inclusive Distance Irregularity Strength of n-ary Tree
JTAM (Jurnal Teori dan Aplikasi Matematika)An inclusive distance vertex irregular labelling of a simple graph G is a function of the vertex set of to positive integer set such that the sum of its vertex label and the labels of all vertices adjacent to the vertex are distinct.
Kristiana Wijaya +3 more
doaj +1 more source
Translational Oncology, 2021 Objectives: The subtype classification of lung adenocarcinoma is important for treatment decision. This study aimed to investigate the deep learning and radiomics networks for predicting histologic subtype classification and survival of lung ...
Chengdi Wang +9 more
doaj +1 more source
On the crossing numbers of join products of five graphs of order six with the discrete graph [PDF]
Opuscula Mathematica, 2020 The main purpose of this article is broaden known results concerning crossing numbers for join of graphs of order six. We give the crossing number of the join product \(G^{\ast} + D_n\), where the disconnected graph \(G^{\ast}\) of order six consists of ...
Michal Staš
doaj +1 more source
BMC BioinformaticsMotivation The prediction of cancer drug response is a challenging subject in modern personalized cancer therapy due to the uncertainty of drug efficacy and the heterogeneity of patients.
Chuanqi Lao +5 more
doaj +1 more source
HeliyonThis study aims to analyze the application of the RBL-STEM learning model in improving students' financial literacy to control their consumptive behavior.
Sumarno +5 more
doaj +1 more source
On the strong beta-number of galaxies with three and four components
AKCE International Journal of Graphs and Combinatorics, 2020 The beta-number of a graph is the smallest positive integer for which there exists an injective function such that each is labeled and the resulting set of edge labels is for some positive integer . The beta-number of is if there exists no such integer .
Rikio Ichishima +2 more
doaj +1 more source