Results 101 to 110 of about 92,446 (202)
Relations between ordinary energy and energy of a self-loop graph
HeliyonLet G be a graph on n vertices with vertex set V(G) and let S⊆V(G) with |S|=α. Denote by GS, the graph obtained from G by adding a self-loop at each of the vertices in S.
B.R. Rakshith +3 more
doaj +1 more source
Ore‐Type Conditions for Existence of a Jellyfish in a Graph
Journal of Graph Theory, Volume 111, Issue 4, Page 124-143, April 2026.ABSTRACT The famous Dirac's theorem states that for each n ≥ 3 every n‐vertex graph G with minimum degree δ ( G ) ≥ n / 2 has a Hamiltonian cycle. When δ ( G ) < n / 2, this cannot be guaranteed, but the existence of some other specific subgraphs can be provided.
Jaehoon Kim +2 more
wiley +1 more source
The $z$-matching problem on bipartite graphs
, 2018 The $z$-matching problem on bipartite graphs is studied with a local algorithm. A $z$-matching ($z \ge 1$) on a bipartite graph is a set of matched edges, in which each vertex of one type is adjacent to at most $1$ matched edge and each vertex of the ...
Zhao, Jin-Hua
core
Recognizing Graphs Close to Bipartite Graphs
, 2017 We continue research into a well-studied family of problems that ask if the vertices of a graph can be partitioned into sets A and B, where A is an independent set and B induces a graph from some specified graph class G. We let G be the class of k-degenerate graphs.
Bonamy, Marthe +4 more
openaire +4 more sources
Recoloring via Modular Decomposition
Journal of Graph Theory, Volume 111, Issue 4, Page 113-123, April 2026.ABSTRACT The reconfiguration graph of the k‐colorings of a graph G, denoted R k ( G ), is the graph whose vertices are the k‐colorings of G and two colorings are adjacent in R k ( G ) if they differ in color on exactly one vertex. A graph G is said to be recolorable if R ℓ ( G ) is connected for all ℓ ≥ χ ( G ) + 1.
Manoj Belavadi +2 more
wiley +1 more source
Networks, Volume 87, Issue 3, Page 312-321, April 2026.ABSTRACT The minimum s$$ s $$‐t$$ t $$‐cut problem is one of the most‐studied problems in discrete optimization and has a unique complexity status in multi‐objective optimization. Even though the single‐objective version of the problem can be solved in polynomial time, it has been shown in the seminal work of Papadimitriou and Yannakakis (2000) that ...
Jan Boeckmann +4 more
wiley +1 more source
Weak saturation numbers of K2 , t and K p ⋃ K q
AKCE International Journal of Graphs and Combinatorics, 2019 A graph G is weakly F-saturated if G contains no copy of F, and there is an ordering of all edges of G¯so that if they are added one at a time, they form a complete graph and each edge added creates a new copy of F.
Yajuan Cui, Liqun Pu
doaj +1 more source
Discrete Applied Mathematics, 1987 It is shown that bipartite permutation graphs have good algorithmic properties in contrast to general bipartite or permutation graphs. Two characterizations of these graphs are presented which lead to a linear time recognition algorithm and also to polynomial algorithms for Hamiltonian problems, a variant of the crossing number problem and the minimum ...
Spinrad, Jeremy +2 more
openaire +1 more source
Artificial intelligence streamlines scientific discovery of drug–target interactions
British Journal of Pharmacology, Volume 183, Issue 8, Page 1673-1690, April 2026.Abstract Drug discovery is a complicated process through which new therapeutics are identified to prevent and treat specific diseases. Identification of drug–target interactions (DTIs) stands as a pivotal aspect within the realm of drug discovery and development. The traditional process of drug discovery, especially identification of DTIs, is marked by
Yuxin Yang, Feixiong Cheng
wiley +1 more source