Results 91 to 100 of about 945,213 (292)

Approximation Algorithms for Multicoloring Planar Graphs and Powers of Square and Triangular Meshes

Discrete Mathematics & Theoretical Computer Science, 2006
A multicoloring of a weighted graph G is an assignment of sets of colors to the vertices of G so that two adjacent vertices receive two disjoint sets of colors. A multicoloring problem on G is to find a multicoloring of G.
Mustapha Kchikech, Olivier Togni
doaj  

Liquid biopsy‐based diagnostic evaluation of hypermethylated CpG sites for ovarian cancer diagnosis

Molecular Oncology, EarlyView.
This schematic outlines the workflow from biomarker identification to duplex MethyLight assay validation for epithelial ovarian cancer diagnosis using cfDNA‐based liquid biopsy. Initial screening of hypermethylated CpG candidates (cg02957270, cg10061138 cg00480298, COL2A1) was performed in tissue using ARMS‐PCR, COBRA, qPCR and image analysis. Selected
Deepa Bisht, Sameer Gupta, Amrita Chaurasia, Manisha Sachan   +3 more
wiley   +1 more source

Eigenvector Distance-Modulated Graph Neural Network: Spectral Weighting for Enhanced Node Classification

Mathematics
Graph Neural Networks (GNNs) face significant challenges in node classification across diverse graph structures. Traditional message passing mechanisms often fail to adaptively weight node relationships, thereby limiting performance in both homophilic ...
Ahmed Begga, Francisco Escolano, Miguel Ángel Lozano   +2 more
doaj   +1 more source

Some New Properties for Degree-Based Graph Entropies

Entropy, 2015
The graph entropies inspired by Shannon’s entropy concept become the information-theoretic quantities for measuring the structural information of graphs and complex networks.
Guoxiang Lu, Bingqing Li, Lijia Wang
doaj   +1 more source

On the difference of the enhanced power graph and the power graph of a finite group

Journal of Combinatorial Theory, Series A
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sucharita Biswas, Peter J. Cameron, Angsuman Das, Hiranya Kishore Dey   +3 more
openaire   +4 more sources

Graph Homomorphism Revisited for Graph Matching [PDF]

, 2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional notions of graph homomorphism and isomorphism often fall short of capturing
Li, Jianzhong, Ma, Shuai, Fan, Wenfei; id_orcid, Wu, Yinghui, Wang, Hongzhi   +4 more
core  

The H-Line Signed Graph of a Signed Graph [PDF]

, 2010
For standard terminology and notion in graph theory we refer the reader to Harary; the non-standard will be given in this paper as and when required.
Reddy, Siva Kota, Subramanya, M.S., Rangarajan, R.   +2 more
core   +1 more source

Epigenetic heterogeneity and plasticity in therapy‐induced tumor states through single‐cell multi‐omics

Molecular Oncology, EarlyView.
Single‐cell multi‐omics reveals epigenetic heterogeneity across therapy‐adaptive tumor states, including quiescent/dormant, drug‐tolerant persister, and EMT‐like phenotypes. By linking regulatory features with state‐associated biomarkers, these approaches inform biomarker‐guided therapeutic strategies for evolving tumors.
Hee Jung Kim, Hwiyeong Lee, Jin Hong, Daechan Park   +3 more
wiley   +1 more source

Uncodified Prerogative Powers and Prerogative Powers

, 2012
Talk on ‘Uncodified Prerogative Powers and Prerogative Powers’ at Mykolas Romeris University in May ...
Kathrani, P.
core  

Forcing (G,D)-number of a Graph [PDF]

, 2011
By a graph G=(V,E), we mean a finite, undirected connected graph without loops and multiple ...
Nagarajan, A., A.Nagarajan, Palani, K., K.Palani   +3 more
core   +1 more source