Results 61 to 70 of about 5,977,266 (359)
Line graph embedding of co-intersection graph of ideals of commutative rings
AKCE International Journal of Graphs and CombinatoricsThis research paper focuses on the co-intersection graph of a commutative ring [Formula: see text]. The co-intersection graph of [Formula: see text] denoted by [Formula: see text] is a simple graph with vertices that are non-trivial ideals of [Formula ...
Ali Al Khabyah +4 more
doaj +1 more source
Characterization of Line-Consistent Signed Graphs
Discussiones Mathematicae Graph Theory, 2015 The line graph of a graph with signed edges carries vertex signs. A vertex-signed graph is consistent if every circle (cycle, circuit) has positive vertex-sign product. Acharya, Acharya, and Sinha recently characterized line-consistent signed graphs, i.e.
Slilaty Daniel C., Zaslavsky Thomas
doaj +1 more source
The line completion number of hypercubes
AKCE International Journal of Graphs and Combinatorics, 2019 In 1992, Bagga, Beineke, and Varma introduced the concept of the super line graph of index r of a graph G, denoted by ℒr(G). The vertices of ℒr(G)are the r-subsets of E(G), and two vertices S and T are adjacent if there exist s∈S and t∈T such that s and ...
S.A. Tapadia, B.N. Waphare
doaj +1 more source
FoxO1 signaling in B cell malignancies and its therapeutic targeting
FEBS Letters, EarlyView.FoxO1 has context‐specific tumor suppressor or oncogenic character in myeloid and B cell malignancies. This includes tumor‐promoting properties such as stemness maintenance and DNA damage tolerance in acute leukemias, or regulation of cell proliferation and survival, or migration in mature B cell malignancies.
Krystof Hlavac +3 more
wiley +1 more source
On Hamilton Decompositions of Line Graphs of Non-Hamiltonian Graphs and Graphs without Separating Transitions [PDF]
, 2017 In contrast with Kotzig's result that the line graph of a $3$-regular graph $X$ is Hamilton decomposable if and only if $X$ is Hamiltonian, we show that for each integer $k\geq 4$ there exists a simple non-Hamiltonian $k$-regular graph whose line graph ...
Bryant, Darryn +2 more
core +1 more source
Discrete Mathematics, 1991 First the author shows that the answers to two questions due to A. Neumaier are `No'. Then he shows how to modifiy the second question in order to obtain an affirmative answer. In fact he proves (in design theoretical terminology) the following: Let \(G\) be some (connected) graph where each neighborhood induces a line graph and where each edge is ...
openaire +2 more sources
Glasgow Mathematical Journal, 1976 In this paper all graphs will be ordinary graphs, i.e. finite, undirected, and without loops or multiple edges. For points x and y of a graph G, we shall indicate that x is adjacent to y by writing x ⊥ y, and if x is not adjacent to y we shall write xy.
openaire +3 more sources
On chordal graph and line graph squares [PDF]
Discrete Applied Mathematics, 2018 In this work we investigate the chordality of squares and line graph squares of graphs. We prove a sufficient condition for the chordality of squares of graphs not containing induced cycles of length at least five. Moreover, we characterize the chordality of graph squares by forbidden subgraphs.
Robert Scheidweiler +1 more
openaire +3 more sources
Line Graphs of Monogenic Semigroup Graphs
Journal of Mathematics, 2021 The concept of monogenic semigroup graphs Γ S M
Nihat Akgunes +2 more
openaire +3 more sources
From omics to AI—mapping the pathogenic pathways in type 2 diabetes
FEBS Letters, EarlyView.Integrating multi‐omics data with AI‐based modelling (unsupervised and supervised machine learning) identify optimal patient clusters, informing AI‐driven accurate risk stratification. Digital twins simulate individual trajectories in real time, guiding precision medicine by matching patients to targeted therapies.
Siobhán O'Sullivan +2 more
wiley +1 more source