Results 61 to 70 of about 390,128 (262)

A Note On Line Graphs

, 2011
In this note we define two generalizations of the line graph and obtain some results. Also, we mark some open problems.
Reddy, P. Siva Kota, Permi, Kavita S., Prashanth, B.   +2 more
openaire   +3 more sources

Circular RNA expression landscapes in myelodysplastic neoplasms: Associations with mutational signatures and disease progression

Molecular Oncology, EarlyView.
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, Morten Tulstrup, Gabriele Todisco, Pedro Moura, Christophe Côme, Jakob Werner Hansen, Jakob Schmidt Jespersen, Balthasar Schlotmann, Maria Creignou, Mette Dahl, Claudia Schöllkopf, Klas Raaschou‐Jensen, Krister Wennerberg, Bo Porse, Joachim Weischenfeldt, Eva Hellström‐Lindberg, Lasse Sommer Kristensen, Kirsten Grønbæk   +17 more
wiley   +1 more source

Graphons of Line Graphs

CoRR
We consider the problem of estimating graph limits, known as graphons, from observations of sequences of sparse finite graphs. In this paper we show a simple method that can shed light on a subset of sparse graphs. The method involves mapping the original graphs to their line graphs.
Sevvandi Kandanaarachchi, Cheng Soon Ong
openaire   +2 more sources

Network divergence analysis identifies adaptive gene modules and two orthogonal vulnerability axes in pancreatic cancer

Molecular Oncology, EarlyView.
Tumors contain diverse cellular states whose behavior is shaped by context‐dependent gene coordination. By comparing gene–gene relationships across biological contexts, we identify adaptive transcriptional modules that reorganize into distinct vulnerability axes.
Brian Nelson, Lyanne Delgado‐Coka, Natalia Marchenko, Luisa F. Escobar‐Hoyos, Kenneth R. Shroyer, Alisa Yurovsky, Trey Ideker, Gábor Balázsi, Thomas MacCarthy, Scott Powers   +9 more
wiley   +1 more source

On neighbourhood line graphs

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   +1 more source

Some results involving the Aα-eigenvalues for graphs and line graphs

Special Matrices
Let GG be a simple graph with adjacency matrix A(G)A\left(G), degree diagonal matrix D(G),D\left(G), and let l(G)l\left(G) be the line graph of GG. In 2017, Nikiforov defined the Aα{A}_{\alpha }-matrix of GG, Aα(G){A}_{\alpha }\left(G), as a linear ...
da Silva Júnior João Domingos G., Oliveira Carla Silva, da Costa Liliana Manuela G. C.   +2 more
doaj   +1 more source

COMP–PMEPA1 axis promotes epithelial‐to‐mesenchymal transition in breast cancer cells

Molecular Oncology, EarlyView.
This study reveals that cartilage oligomeric matrix protein (COMP) promotes epithelial‐to‐mesenchymal transition (EMT) in breast cancer. We identify PMEPA1 (protein TMEPAI) as a novel COMP‐binding partner that mediates EMT via binding to the TSP domains of COMP, establishing the COMP–PMEPA1 axis as a key EMT driver in breast cancer.
Konstantinos S. Papadakos, Gilar Gorji‐bahri, Lejla Gradjan, Julia Zajac, Kacper Gil, Yvonne Thokozile Nduku, Anna M. Blom   +6 more
wiley   +1 more source

On hamiltonian line-graphs [PDF]

Transactions of the American Mathematical Society, 1968
Introduction. The line-graph L(G) of a nonempty graph G is the graph whose point set can be put in one-to-one correspondence with the line set of G in such a way that two points of L(G) are adjacent if and only if the corresponding lines of G are adjacent.
openaire   +1 more source

Padmakar-Ivan index of some types of perfect graphs [PDF]

Discrete Mathematics Letters, 2022
Manju Sankaramalil Chithrabhanu, Kanagasabapathi Somasundaram   +1 more
doaj   +1 more source

General sum-connectivity index, general product-connectivity index, general Zagreb index and coindices of line graph of subdivision graphs

AKCE International Journal of Graphs and Combinatorics, 2017
The general sum-connectivity index, general product-connectivity index, general Zagreb index and coindices of line graphs of subdivision graphs of tadpole graphs, wheels and ladders have been reported in the literature.
Harishchandra S. Ramane, Vinayak V. Manjalapur, Ivan Gutman   +2 more
doaj   +1 more source