Results 191 to 200 of about 8,313 (308)

Identifying HIV-induced subgraph patterns in brain networks with side information. [PDF]

Brain Inform, 2015
Cao B, Kong X, Zhang J, Yu PS, Ragin AB.
europepmc   +1 more source

Properly Colored Cycles in Edge‐Colored Balanced Bipartite Graphs

Journal of Graph Theory, Volume 112, Issue 2, Page 37-53, June 2026.
ABSTRACT Let G n , n c denote a (not necessarily properly) edge‐colored balanced bipartite graph on 2 n vertices, that is, in which every edge is assigned a color. A cycle C in G n , n c is called properly colored if any two consecutive edges of C have distinct colors.
Tingting Han, Hajo Broersma, Shenggui Zhang, Yandong Bai   +3 more
wiley   +1 more source

Learning Rule-Induced Subgraph Representations for Inductive Relation Prediction

Inductive relation prediction (IRP) -- where entities can be different during training and inference -- has shown great power for completing evolving knowledge graphs.
Lv, Qitan, Yang, Shuling, Liu, Tianyu, Wang, Jie, Chen, Hanzhu   +4 more
core   +1 more source

Domination in 4‐Regular Graphs With No Induced 4‐Cycles

Journal of Graph Theory, Volume 112, Issue 2, Page 62-95, June 2026.
ABSTRACT A set S of vertices in a graph G is a dominating set of G if every vertex not in S is adjacent to a vertex in S. The domination number of G, denoted by γ ( G ), is the minimum cardinality of a dominating set in G. The 1 3‐conjecture for domination in 4‐regular graphs states that if G is a 4‐regular graph of order n, then γ ( G ) ≤ 1 3 n.
Michael A. Henning, Anders Yeo
wiley   +1 more source

Word-representability and comparability: Minimal forbidden induced subgraphs and cover number bounds [PDF]

Benny George Kenkireth, Gopalan Sajith, Sreyas Sasidharan   +2 more
openalex   +1 more source

On-line Maximum-order Induced Hereditary Subgraph Problems.

We first study the competitivity ratio for the on-line version of the problem of finding a maximum-order induced subgraph satisfying some hereditary property, under the hypothesis that the input graph is revealed by clusters.
Paschos, V.T., Demange, M., Paradon, X.
core  

Another Proof of the Generalized Tutte—Berge Formula for f‐Bounded Subgraphs

Journal of Graph Theory, Volume 112, Issue 2, Page 145-150, June 2026.
ABSTRACT Given a nonnegative integer weight f ( v ) for each vertex v in a multigraph G, an f‐bounded subgraph of G is a multigraph H contained in G such that d H ( v ) ≤ f ( v ) for all v ∈ V ( G ). Using Tutte's f‐Factor Theorem, we give a new proof of the min–max relation for the maximum size of an f‐bounded subgraph of G. When f ( v ) = 1 for all v,
Zishen Qu, Douglas B. West
wiley   +1 more source

The Independence Ratio of 4‐Cycle‐Free Planar Graphs

Journal of Graph Theory, Volume 112, Issue 2, Page 116-127, June 2026.
ABSTRACT We prove that every n‐vertex planar graph G with no triangle sharing an edge with a 4‐cycle has independence ratio n ∕ α ( G ) ≤ 4 − ε for ε = 1 ∕ 30. This result implies that the same bound holds for 4‐cycle‐free planar graphs and planar graphs with no adjacent triangles and no triangle sharing an edge with a 5‐cycle.
Tom Kelly, Sid Kolichala, Caleb McFarland, Jatong Su   +3 more
wiley   +1 more source

Robustness Assessment of Public Transport Networks in Various Graph Representations: Systematic Review, Decision Support, and Case Study

Networks, Volume 87, Issue 4, Page 343-371, June 2026.
ABSTRACT The analysis of certain properties of the underlying graph of a public transport network generates insights about the network's structure. Hereby, the choice of the graph representation depends on a trade‐off between complexity reduction and information preservation to adequately model a public transport network.
Michael Palk, Stefan Voß, Raka Jovanovic   +2 more
wiley   +1 more source

Sparse induced subgraphs of large treewidth

Journal of Combinatorial Theory, Series B
16 pages, 3 ...
openaire   +3 more sources