Results 91 to 100 of about 21,959 (221)
Chordal Graphs, Even‐Hole‐Free Graphs and Sparse Obstructions to Bounded Treewidth
Journal of Graph Theory, Volume 110, Issue 3, Page 351-365, November 2025.ABSTRACT Even‐hole‐free graphs pose a central challenge in identifying hereditary classes of bounded treewidth. We investigate this matter by presenting and studying the following conjecture: for an integer t ≥ 4 and a graph H, every even‐hole‐free graph of large enough treewidth has an induced subgraph isomorphic to either K t or H, if (and only if) H
Sepehr Hajebi
wiley +1 more source
Matched Filters for Noisy Induced Subgraph Detection [PDF]
, 2018 The problem of finding the vertex correspondence between two noisy graphs with different number of vertices where the smaller graph is still large has many applications in social networks, neuroscience, and computer vision.
Lyzinski, Vince +3 more
core
Finite Dimensional Representations of Leavitt Path Algebras
, 2017 When $\Gamma$ is a row-finite di(rected )graph we classify all finite dimensional modules of the Leavitt path algebra $L(\Gamma)$ via an explicit Morita equivalence given by an effective combinatorial (reduction) algorithm on the digraph $\Gamma$.
Koç, Ayten, Özaydın, Murad
core +1 more source
A Method for the Quality‐Aware Automated Selection of Deployment Technologies
Software: Practice and Experience, Volume 55, Issue 11, Page 1855-1876, November 2025.ABSTRACT Domain The deployment of distributed multi‐component cloud applications typically requires a combination of multiple heterogeneous deployment technologies. A different combination of deployment technologies should be chosen due to varying deployment qualities, such as the functional suitability and reliability of the deployment technologies ...
Miles Stötzner +7 more
wiley +1 more source
Generalized Fractional Total Colorings of Complete Graph
Discussiones Mathematicae Graph Theory, 2013 An additive and hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphism. Let P and Q be two additive and hereditary graph properties and let r, s be integers such that r ≥ s Then an fractional (P,
Karafová Gabriela
doaj +1 more source
Subgraph Query for Building Service-Based Systems
IEEE Access, 2019 Given the broad applications of service-oriented architecture (SOA) in service-oriented software engineering, service-based systems (SBSs) built from existing Web services are becoming increasingly popular.
Jintao Wu +5 more
doaj +1 more source
Asymmetric graphs with quantum symmetry
Proceedings of the London Mathematical Society, Volume 131, Issue 5, November 2025.Abstract We present an infinite sequence of finite graphs with trivial automorphism group and non‐trivial quantum automorphism group. These are the first known examples of graphs with this property. Moreover, to the best of our knowledge, these are the first examples of any asymmetric classical space that has non‐trivial quantum symmetries.
Josse van Dobben de Bruyn +2 more
wiley +1 more source
Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials
Journal of Graph Theory, Volume 110, Issue 2, Page 127-131, October 2025.ABSTRACT An oriented graph D is converse invariant if, for any tournament T, the number of copies of D in T is equal to that of its converse − D. El Sahili and Ghazo Hanna [J. Graph Theory 102 (2023), 684‐701] showed that any oriented graph D with maximum degree at most 2 is converse invariant. They proposed a question: Can we characterize all converse
Jiangdong Ai +4 more
wiley +1 more source
On Endomorphism Universality of Sparse Graph Classes
Journal of Graph Theory, Volume 110, Issue 2, Page 223-244, October 2025.ABSTRACT We show that every commutative idempotent monoid (a.k.a. lattice) is the endomorphism monoid of a subcubic graph. This solves a problem of Babai and Pultr and the degree bound is best‐possible. On the other hand, we show that no class excluding a minor can have all commutative idempotent monoids among its endomorphism monoids. As a by‐product,
Kolja Knauer, Gil Puig i Surroca
wiley +1 more source
The Cartesian product of graphs with loops [PDF]
, 2014 We extend the definition of the Cartesian product to graphs with loops and show that the Sabidussi-Vizing unique factorization theorem for connected finite simple graphs still holds in this context for all connected finite graphs with at least one ...
Christiaan E. Van De Woestijne +7 more
core