Results 141 to 150 of about 10,447 (245)
Drug-target interaction prediction using semi-bipartite graph model and deep learning. [PDF]
BMC Bioinformatics, 2020 Eslami Manoochehri H, Nourani M.
europepmc +1 more source
Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs
Journal of Graph Theory, Volume 113, Issue 2, Page 252-273, October 2026.ABSTRACT A bisection of a graph is a cut in which the number of vertices in the two parts of the cut differ by at most 1. In this paper, we consider maximum weight bisections of edge‐weighted triangle‐free subcubic graphs and show that every weighted triangle‐free subcubic graph G = ( V , E , w )
wiley +1 more source
Hitting Times in the Binomial Random Graph
Journal of Graph Theory, Volume 113, Issue 2, Page 377-393, October 2026.ABSTRACT Fix k ≥ 2 , choose log n n ( k − 1 ) ∕ k ≤ p ≤ 1 − Ω ( log 4 n n )
wiley +1 more source
On the Hardness of Switching to a Small Number of Edges
Journal of Graph Theory, Volume 113, Issue 2, Page 237-251, October 2026.ABSTRACT Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non‐adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching‐equivalent if one can be made isomorphic to the other one by a sequence of switches. Jelínková et al. [DMTCS 13, no. 2, 2011]
Vít Jelínek +2 more
wiley +1 more source
Drug Development Research, Volume 87, Issue 6, September 2026.ABSTRACT Alzheimer's disease (AD) is a multifactorial neurodegenerative disorder for which single‐target therapies often provide insufficient benefit, motivating the development of multi‐target‐directed ligands (MTDLs). In this study, a novel series of benzimidazolone‐based hybrids incorporating piperazine, coumarin, and triazole moieties was designed,
Fatih Yılmaz +4 more
wiley +1 more source
Signed Projective Cubes, a Homomorphism Point of View
Journal of Graph Theory, Volume 113, Issue 1, Page 38-56, September 2026.ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen +2 more
wiley +1 more source
Fractional Balanced Chromatic Number and Arboricity of Planar (Signed) Graphs
Journal of Graph Theory, Volume 113, Issue 1, Page 5-18, September 2026.ABSTRACT A balanced ( p , q )‐coloring of a signed graph ( G , σ ) is an assignment of q colors to each vertex of G from a platter of p colors, such that each color class induces a balanced set (a set that does not induce a negative cycle). The fractional balanced chromatic number of ( G , σ ), denoted χ f b ( G , σ ), is the minimum ratio p / q such ...
Reza Naserasr +3 more
wiley +1 more source
Fractional List Packing for Layered Graphs
Journal of Graph Theory, Volume 113, Issue 1, Page 19-37, September 2026.ABSTRACT The fractional list packing number χ ℓ • ( G ) of a graph G is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N need to be to ensure the existence of a “perfectly balanced” probability distribution on proper L‐colourings, that is, such ...
Stijn Cambie, Wouter Cames van Batenburg
wiley +1 more source
Distributed Integrated Scheduling Algorithm for Identical Two-Workshop Based on the Improved Bipartite Graph. [PDF]
Sensors (Basel)Wei Y, Zhou W, Zhao J, Tan Z, Xie Z.
europepmc +1 more source
On Tight Tree‐Complete Hypergraph Ramsey Numbers
Journal of Graph Theory, Volume 113, Issue 1, Page 88-96, September 2026.ABSTRACT Chvátal showed that for any tree T with k edges, the Ramsey number R ( T , n ) = k ( n − 1 ) + 1. For r = 3 or 4, we show that, if T is an r‐uniform nontrivial tight tree, then the hypergraph Ramsey number R ( T , n ) = Θ ( n r − 1 ). The 3‐uniform result comes from observing a construction of Cooper and Mubayi.
Jiaxi Nie
wiley +1 more source