Results 71 to 80 of about 39,682 (219)

Induced Minor Free Graphs: Isomorphism and Clique-width

, 2016
Given two graphs $G$ and $H$, we say that $G$ contains $H$ as an induced minor if a graph isomorphic to $H$ can be obtained from $G$ by a sequence of vertex deletions and edge contractions.
Belmonte, Rémy, Otachi, Yota, Schweitzer, Pascal   +2 more
core   +1 more source

Exploring Causal Learning Through Graph Neural Networks: An In‐Depth Review

WIREs Data Mining and Knowledge Discovery, Volume 15, Issue 2, June 2025.
Graphical abstract of the survey with a taxonomical approach to causal learning with graph neural networks. ABSTRACT In machine learning, exploring data correlations to predict outcomes is a fundamental task. Recognizing causal relationships embedded within data is pivotal for a comprehensive understanding of system dynamics, the significance of which ...
Simi Job, Xiaohui Tao, Taotao Cai, Haoran Xie, Lin Li, Qing Li, Jianming Yong   +6 more
wiley   +1 more source

Profinite rigidity for free‐by‐cyclic groups with centre

Journal of the London Mathematical Society, Volume 111, Issue 6, June 2025.
Abstract A free‐by‐cyclic group FN⋊ϕZ$F_N\rtimes _\phi \mathbb {Z}$ has non‐trivial centre if and only if [ϕ]$[\phi]$ has finite order in Out(FN)${\rm {Out}}(F_N)$. We establish a profinite rigidity result for such groups: if Γ1$\Gamma _1$ is a free‐by‐cyclic group with non‐trivial centre and Γ2$\Gamma _2$ is a finitely generated free‐by‐cyclic group ...
Martin R. Bridson, Paweł Piwek
wiley   +1 more source

On profinite rigidity amongst free‐by‐cyclic groups I: The generic case

Proceedings of the London Mathematical Society, Volume 130, Issue 6, June 2025.
Abstract We prove that amongst the class of free‐by‐cyclic groups, Gromov hyperbolicity is an invariant of the profinite completion. We show that whenever G$G$ is a free‐by‐cyclic group with first Betti number equal to one, and H$H$ is a free‐by‐cyclic group which is profinitely isomorphic to G$G$, the ranks of the fibres and the characteristic ...
Sam Hughes, Monika Kudlinska
wiley   +1 more source

Fuzzy graphs and their applications in finding the best route, dominant node and influence index in a network under the hesitant bipolar-valued fuzzy environment

Complex & Intelligent Systems
This paper introduces the concept of hesitant bipolar-valued fuzzy graph (HBVFG), which captures the two opposing perspectives, namely the positive and negative opinions.
Jambi Ratna Raja, Jeong Gon Lee, Dhanraj Dhotre, Pravin Mane, Omprakash Sugdeo Rajankar, Antonios Kalampakas, Navin D. Jambhekar, D. G. Bhalke   +7 more
doaj   +1 more source

Frequent Subgraph Mining in Outerplanar Graphs [PDF]

, 2010
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining problem for tree datasets can be solved in incremental polynomial time, it ...
Horvath, Tamas, Ramon, Jan, Wrobel, Stefan   +2 more
core   +1 more source

On the Ubiquity of Oriented Double Rays

Journal of Graph Theory, Volume 109, Issue 1, Page 62-67, May 2025.
ABSTRACT A digraph H is called ubiquitous if every digraph that contains arbitrarily many vertex‐disjoint copies of H Florian Gut, Thilo Krill, Florian Reich
wiley   +1 more source

The Descriptive Complexity of Subgraph Isomorphism without Numerics

, 2017
Let $F$ be a connected graph with $\ell$ vertices. The existence of a subgraph isomorphic to $F$ can be defined in first-order logic with quantifier depth no better than $\ell$, simply because no first-order formula of smaller quantifier depth can ...
Verbitsky, Oleg, Zhukovskii, Maksim
core   +1 more source

On Rainbow Turán Densities of Trees

Random Structures &Algorithms, Volume 66, Issue 3, May 2025.
ABSTRACT For a given collection 𝒢=(G1,…,Gk) of graphs on a common vertex set V$$ V $$, which we call a graph system, a graph H$$ H $$ on a vertex set V(H)⊆V$$ V(H)\subseteq V $$ is called a rainbow subgraph of 𝒢 if there exists an injective function ψ:E(H)→[k]$$ \psi :E(H)\to \left[k\right] $$ such that e∈Gψ(e)$$ e\in {G}_{\psi (e)} $$ for each e∈E(H)$$
Seonghyuk Im, Jaehoon Kim, Hyunwoo Lee, Haesong Seo   +3 more
wiley   +1 more source

Generic root counts and flatness in tropical geometry

Journal of the London Mathematical Society, Volume 111, Issue 5, May 2025.
Abstract We use tropical and nonarchimedean geometry to study the generic number of solutions of families of polynomial equations over a parameter space Y$Y$. In particular, we are interested in the choices of parameters for which the generic root count is attained.
Paul Alexander Helminck, Yue Ren
wiley   +1 more source