Results 71 to 80 of about 5,414,210 (302)
On the Line Degree Splitting Graph of a Graph
In this paper, we introduce the concept of the line degree splitting graph of a graph. We obtain some properties of this graph. We find the girth of the line degree splitting graphs.
B. Basavanagoud, Roopa S. Kusugal
core +1 more source
Split Legendary Domination in graphs
Harary and Norman introduced the line graph L(G) . We introduced the legendary domination number by combining the domination concept both in graph and its line graph.
P. Kavitha
doaj +1 more source
Wiener Index of Graphs and Their Line Graphs [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Su, Xiaohai, Wang, Ligong, Gao, Yun
openaire +1 more source
In this explorative study, the abundance of circular RNA molecules in bone marrow stem cells was found to be elevated in patients with high‐risk myelodysplastic neoplasms, and to be associated with an increased risk of progression to acute myeloid leukemia.
Eileen Wedge +17 more
wiley +1 more source
In the present work, we have identified a transcriptional signature based on the differential expression of six genes (BCL2&MAST4, HSH2D&LAT2, METRN&PITPNM2) that would facilitate the early detection of T‐cell acute lymphoblastic leukemia (T‐ALL) patients prone to a poor treatment response and could be implemented at diagnosis, along with other risk ...
Antonio Lahera +11 more
wiley +1 more source
Relations between the distinguishing number and some other graph parameters [PDF]
A distinguishing coloring of a simple graph $G$ is a vertex coloring of $G$ which is preserved only by the identity automorphism of $G$. In other words, this coloring ``breaks'' all symmetries of $G$.
Bahman Ahmadi +1 more
doaj +1 more source
KDM7A and KDM1A inhibition suppresses tumour promoting pathways in prostate cancer
Treatment resistance is a major challenge for patients with advanced prostate cancer. This study examined an alternative approach to target the major prostate cancer‐promoting pathway by targeting epigenetic factors, whose levels are higher in tumours.
Jennie N Jeyapalan +16 more
wiley +1 more source
History tracking line graph of this example.
History tracking line graph of this example.
Xinguo Liu (5957930) +4 more
core +1 more source
Graphs with odd and even distances between non-cut vertices [PDF]
We prove that in a connected graph, the distances between non-cut vertices are odd if and only if it is the line graph of a strong unique independence tree.
Kateryna Antoshyna, Sergiy Kozerenko
doaj +1 more source
Incidence matrices and line graphs of mixed graphs
In the theory of line graphs of undirected graphs, there exists an important theorem linking the incidence matrix of the root graph to the adjacency matrix of its line graph. For directed or mixed graphs, however, there exists no analogous result.
Abudayah Mohammad +2 more
doaj +1 more source

