Results 51 to 60 of about 4,550,446 (348)
Embedding Graphs into Colored Graphs [PDF]
Transactions of the American Mathematical Society, 1988 If X X is a graph, κ \kappa a cardinal, then there is a graph Y Y such that if the vertex set of Y Y is κ \kappa -colored, then there exists a monocolored induced copy of X X ; moreover, if X X does not contain a complete graph on
Hajnal, András, Komjáth, P.
openaire +1 more source
The graphs cospectral with the pineapple graph
Discrete Applied Mathematics, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Topcu, Hatice +2 more
openaire +2 more sources
Graphs isomorphic to their path graphs [PDF]
Mathematica Bohemica, 2002 Summary: We prove that for every number \(n\geq 1\), the \(n\)-iterated \(P_3\)-path graph of \(G\) is isomorphic to \(G\) if and only if \(G\) is a collection of cycles, each of length at least 4. Hence, \(G\) is isomorphic to \(P_3(G)\) if and only if \(G\) is a collection of cycles, each of length at least 4.
Knor, Martin, Niepel, L'udovít
openaire +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
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Introduction Cognitive impairment and exercise intolerance are common in dialysis patients. Cerebral perfusion and oxygenation play a major role in both cognitive function and exercise execution; HD session per se aggravates cerebral ischemia in this population. This study aimed to compare cerebral oxygenation and perfusion at rest and in mild
Marieta P. Theodorakopoulou +10 more
wiley +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
Graph properties of graph associahedra [PDF]
, 2015 A graph associahedron is a simple polytope whose face lattice encodes the nested structure of the connected subgraphs of a given graph. In this paper, we study certain graph properties of the 1-skeleta of graph associahedra, such as their diameter and ...
Manneville, Thibault, Pilaud, Vincent
core +1 more source
Supereulerian Graphs and the Petersen Graph
Journal of Combinatorial Theory, Series B, 1996 A graph \(G\) is called supereulerian if \(G\) has a spanning closed trail. Using a reduction technique, which was developed by the first author [A reduction method to find spanning Eulerian subgraphs, J. Graph Theory 12, No. 1, 29-45 (1988; Zbl 0659.05073)], the authors prove that any 3-edge-connected graph with at most 10 edge cuts of size 3 either ...
Catlin, Paul A., Lai, Hong-Jian
openaire +3 more sources
FEBS Letters, EarlyView.Enteropathogenic E. coli (EPEC) infects the human intestinal epithelium, resulting in severe illness and diarrhoea. In this study, we compared the infection of cancer‐derived cell lines with human organoid‐derived models of the small intestine. We observed a delayed in attachment, inflammation and cell death on primary cells, indicating that host ...
Mastura Neyazi +5 more
wiley +1 more source