Results 111 to 120 of about 92,446 (202)

Feedback vertex set on chordal bipartite graphs [PDF]

Let G=(A,B,E) be a bipartite graph with color classes A and B. The graph G is chordal bipartite if G has no induced cycle of length more than four. Let G=(V,E) be a graph. A feedback vertex set F is a set of vertices F subset V such that G-F is a forest.
Kloks, Ton, Liu, Ching-Hao, Poon, Sheung-Hung   +2 more
core  

The use of different types of networks, alone and in combination, for drug target identification

British Journal of Pharmacology, Volume 183, Issue 8, Page 1653-1662, April 2026.
Current therapeutic approaches often focus on targeting clinical symptoms or peripheral phenotypes rather than the underlying molecular mechanisms, or endophenotypes, that drive diseases. While symptom‐based drugs can alleviate discomfort, they do not necessarily alter disease progression and may overlook opportunities for prevention or early ...
Paolo Parini
wiley   +1 more source

Annihilating Graph of Abelian Groups

پژوهش‌های ریاضی, 2021
In [18], the author associated a graph to an R -module M which is precisely a generalization of annihilating ideal graph of a commutative ring, see [15] and [16]. Inasmuch as Abelian groups are precisely Z-modules, in this paper we relate an annihilating
saeed safaeeyan, Soraya Barzegar
doaj  

Predicting lncRNA-protein interactions with bipartite graph embedding and deep graph neural networks. [PDF]

Front Genet, 2023
Ma Y, Zhang H, Jin C, Kang C.
europepmc   +1 more source

Social Inequality in Sight: Exploring Urban Visual Perception and Sentiment Across Income Levels

Transactions in GIS, Volume 30, Issue 2, April 2026.
ABSTRACT Visual perception and sentimental expression are interconnected cognitive processes that shape environmental interaction, functioning at different levels across populations. Despite their inherent connection, prior studies have examined them in isolation, focusing on physical environments and overlooking diverse populations.
Ketong Shen, Jian Liu, Xintao Liu
wiley   +1 more source

scBGEDA: deep single-cell clustering analysis via a dual denoising autoencoder with bipartite graph ensemble clustering. [PDF]

Bioinformatics, 2023
Wang Y, Yu Z, Li S, Bian C, Liang Y, Wong KC, Li X.   +6 more
europepmc   +1 more source

Chromatic number and regular subgraphs

Bulletin of the London Mathematical Society, Volume 58, Issue 4, April 2026.
Abstract In 1992, Erdős and Hajnal posed the following natural problem: Does there exist, for every r∈N$r\in \mathbb {N}$, an integer F(r)$F(r)$ such that every graph with chromatic number at least F(r)$F(r)$ contains r$r$ edge‐disjoint cycles on the same vertex set? We solve this problem in a strong form, by showing that there exist n$n$‐vertex graphs
Barnabás Janzer, Raphael Steiner, Benny Sudakov   +2 more
wiley   +1 more source

Computing the permanental polynomial of 4k-intercyclic bipartite graphs

The American Journal of Combinatorics
Let \(G\) be a bipartite graph with adjacency matrix \(A(G)\). The characteristic polynomial \(\phi(G,x)=\det(xI-A(G))\) and the permanental polynomial \(\pi(G,x) = \operatorname{per}(xI-A(G))\) are both graph invariants used to distinguish graphs.
Ravindra Bapat, Ranveer Singh, Hitesh Wankhede   +2 more
doaj   +1 more source

A note on star coloring of central graph of bipartite graph and corona graph of complete graph with path and cycle [PDF]

Transactions on Combinatorics, 2012
In this paper, we find the star chromatic number of central graph of complete bipartite graph and corona graph of complete graph with path and cycle.
V. J. Vernold, M. Venkatachalam
doaj  

Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm. [PDF]

Front Pharmacol, 2022
Kusuma WA, Habibi ZI, Amir MF, Fadli A, Khotimah H, Dewanto V, Heryanto R.   +6 more
europepmc   +1 more source