Results 111 to 120 of about 5,414,210 (302)

Efficient Direct Reconstruction of Bipartite (Multi)Graphs from Their Line Graphs Through a Characterization of Their Edges

Mathematics
We study the line graphs of bipartite multigraphs, which naturally arise in combinatorics, game theory, and applications such as scheduling and motion planning.
Drago Bokal, Janja Jerebic
doaj   +1 more source

ncRPI-LGAT: Prediction of ncRNA-protein interactions with line graph attention network framework. [PDF]

Comput Struct Biotechnol J, 2023
Han Y, Zhang SW.
europepmc   +1 more source

Interval line graphs

Discrete Mathematics, 1984
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Inhibition of cyclin‐dependent kinases 12/13 using CT7439 as a treatment for colorectal cancer with CDK12 upregulation

Molecular Oncology, EarlyView.
The proposed mechanism of action for the CDK12/13 inhibitor and cyclin K degrader, CT7439. CDK12/13 inhibition interrupts transcription elongation, leading to increased DNA damage that results in cell death. This agent is a potentially novel treatment option for patients with colorectal cancer. Created in BioRender. Cyclin‐dependent kinase (CDK) 12 and
Wylie K. Watlington, Divya L. Dayanidhi, Mohammad Zokaasadi, John B. Mantyh, Pelumi D. Olawuni, Gabrielle Rupprecht, Jeremy M. Force, Shannon McCall, Ashwani K. Bahl, David S. Hsu, Jason A. Somarelli   +10 more
wiley   +1 more source

Total edge-betweenness centrality measure of a graph

Arab Journal of Basic and Applied Sciences
Edge-betweenness centrality measure is an important centrality measure that focuses on the role of edges in a graph. The total edge-betweenness centrality measure (EBCM) of a graph is defined as the sum of the edge-betweenness centrality measures of all ...
Niveditha, K. Arathi Bhat, Shahistha Hanif   +2 more
doaj   +1 more source

On •-Line Signed Graphs L•(S)

Discussiones Mathematicae Graph Theory, 2015
A signed graph (or sigraph for short) is an ordered pair S = (Su,σ), where Su is a graph, G = (V,E), called the underlying graph of S and σ : E → {+,−} is a function from the edge set E of Su into the set {+,−}.
Sinha Deepa, Dhama Ayushi
doaj   +1 more source

GENERAL APPROACH TO LINE GRAPHS OF GRAPHS

Demonstratio Mathematica, 1985
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marczyk, Antoni, Skupień, Zdzisław
openaire   +1 more source

Cancer‐associated mutations in endometriosis reframe a benign disease through molecular oncology

Molecular Oncology, EarlyView.
This review aims to comprehensively analyse cancer‐associated somatic mutations (CAMs) present in endometriotic lesions, emphasizing their biological roles, spatial distribution and implications for translational applications in medicine. By contextualizing a benign state within a genomic framework, this analysis seeks to establish its value as a ...
Clarissa Mujacic, Maria Concetta Vitale, Rita Siino, Emilia Di Giovanni, Carla Ferrante Bannera, Enrico Di Marco, Andrea Gottardo, Tancredi Didier Bazan Russo, Nadia Barraco, Alessandro Perez, Valerio Gristina, Antonio Galvano, Giuseppe Badalamenti, Antonio Russo, Viviana Bazan, Lorena Incorvaia   +15 more
wiley   +1 more source

SALBPGen - A systematic data generator for (simple) assembly line balancing [PDF]

Assembly line balancing is a well-known and extensively researched decision problem which arises when assembly line production systems are designed and operated.
Christian Otto, Alena Otto, Armin Scholl
core  

Pragmatic Graph Rewriting Modifications [PDF]

, 1999
We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host graph, where nodes specified as 'Once Only' in the LHS of a rewrite match ...
Rodgers, Peter, Vidal, Natalia, P.J. Rodgers, N. Vidal   +3 more
core   +1 more source