Results 81 to 90 of about 5,977,266 (359)
The M-polynomial of line graph of subdivision graphs
Three composite graphs Ladder graph (L_{n}), Tadpole graph (T_{n,k}) and Wheel graph (W_{n}) are graceful graphs, which have different applications in electrical, electronics, wireless communication etc. In this report, we first determine M-polynomial of
S. Mondal, Nilanjan De, A. Pal
semanticscholar +1 more source
Single‐cell RNA sequencing reveals an opposite role of SLPI in basal tumors based on metastatic spread, along with shared activation of specific regulons in cancer cells and mature luminal lactocytes, as well as downregulation of MALAT1 and NEAT1 in the latter.
Pietro Ancona+4 more
wiley +1 more source
Line graphs of directed graphs I [PDF]
We determine the forbidden induced subgraphs for the intersection of the classes of chordal bipartite graphs and line graphs of acyclic directed graphs. This is a first step towards finding the forbidden induced subgraphs for the class of line graphs of ...
Vaidyanathan Sivaraman, Daniel Slilaty
doaj +1 more source
AbstractBrualdi and Shanny [R.A. Brualdi, R.F. Shanny, Hamiltonian line graphs, J. Graph Theory 5 (1981) 307–314], Clark [L. Clark, On hamitonian line graphs, J. Graph Theory 8 (1984) 303–307] and Veldman [H.J. Veldman, On dominating and spanning circuits in graphs, Discrete Math.
Minmin Zong, Liming Xiong
openaire +2 more sources
RAD50 missense variants differentially affect the DNA damage response and mitotic progression
RAD50 incorporates into the MRN complex and initiates the DNA damage response. Furthermore, RAD50 promotes mitotic progression. RAD50 missense variants capable of forming an MRN complex supported the DNA damage response and mitotic features to different extents in complementation experiments, indicating these functions are separable and might impact ...
Hanna Redeker+9 more
wiley +1 more source
Maintenance of Strongly Connected Component in Shared-memory Graph
In this paper, we present an on-line fully dynamic algorithm for maintaining strongly connected component of a directed graph in a shared memory architecture. The edges and vertices are added or deleted concurrently by fixed number of threads.
C Demetrescu+4 more
core +1 more source
Paw-Type Characterization of Hourglass-Free Hamilton-Connected Graphs
This paper introduces the forbidden subgraph conditions for Hamilton-connected graphs. If the degree sequence of the graph is (4,2,2,2,2) and it is connected, then it is called hourglassΓ0.
Panpan Wang, Liming Xiong
doaj +1 more source
Zagreb Polynomials and Redefined Zagreb indices for the Line Graph of Carbon Nanocones
A line graph has many useful applications in physical chemistry. Topological indices are numerical parameters associated to a structure and, in combination, determine properties of the concerned material.
Saba Noreen, Atif Mahmood
semanticscholar +1 more source
Cell‐free DNA aneuploidy score as a dynamic early response marker in prostate cancer
mFast‐SeqS‐based genome‐wide aneuploidy scores are concordant with aneuploidy scores obtained by whole genome sequencing from tumor tissue and can predict response to ARSI treatment at baseline and, at an early time point, to ARSI and taxanes. This assay can be easily performed at low cost and requires little input of cfDNA. Cell‐free circulating tumor
Khrystany T. Isebia+17 more
wiley +1 more source
Projective dimension and regularity of the path ideal of the line graph [PDF]
By generalizing the notion of the path ideal of a graph, we study some algebraic properties of some path ideals associated to a line graph. We show that the quotient ring of these ideals are always sequentially Cohen–Macaulay and also provide some exact ...
G. Zhu
semanticscholar +1 more source