Results 51 to 60 of about 6,506,964 (218)
A note on the minimum rank of graphs with given dominating induced subgraph
The American Journal of CombinatoricsAn induced subgraph of a graph \(G\) is said to be dominating if every vertex of \(G\) is at distance at most one from this subgraph. We investigate pairs \((G, F)\) where \(F\) is a non-singular dominating induced subgraph of \(G,\) and the rank of \(G\
Zoran Stanić
doaj +1 more source
Subgraph Queries by Context-free Grammars
Journal of Integrative Bioinformatics, 2008 We describe a method for querying vertex- and edge-labeled graphs using context-free grammars to specify the class of interesting paths. We introduce a novel problem, finding the connection subgraph induced by the set of matching paths between given two ...
Sevon Petteri, Eronen Lauri
doaj +1 more source
Dimer models and conformal structures
Communications on Pure and Applied Mathematics, Volume 79, Issue 2, Page 340-446, February 2026.Abstract Dimer models have been the focus of intense research efforts over the last years. Our paper grew out of an effort to develop new methods to study minimizers or the asymptotic height functions of general dimer models and the geometry of their frozen boundaries.
Kari Astala +3 more
wiley +1 more source
A complex network perspective on brain disease
Biological Reviews, Volume 101, Issue 1, Page 364-399, February 2026.ABSTRACT If brain anatomy and dynamics have a complex network structure as it has become standard to posit, it is reasonable to assume that such a structure should play a key role not only in brain function but also in brain dysfunction. However, exactly how network structure is implicated in brain damage and whether at least some pathologies can be ...
David Papo, Javier M. Buldú
wiley +1 more source
A fundamental theorem on graph operators
Mathematics OpenA graph operator is a function [Formula: see text] defined on some set of graphs such that whenever two graphs G and H are isomorphic, written [Formula: see text], then [Formula: see text].
Severino V. Gervacio
doaj +1 more source
Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree [PDF]
, 2023 Tara Abrishami +6 more
openalex +1 more source
Distributed SE(d) Formation Control of Multi‐Agent Systems Using Relative Measurements
International Journal of Robust and Nonlinear Control, Volume 36, Issue 1, Page 100-116, 10 January 2026.ABSTRACT This study develops a solution to the distributed SE(d) formation control problem of multi‐agent systems using only relative measurements between agents. In this problem, poses, that is, orientations and positions, of the agents are expected to achieve desired ones.
Chunlai Peng +4 more
wiley +1 more source
Hereditary Equality of Domination and Exponential Domination
Discussiones Mathematicae Graph Theory, 2018 We characterize a large subclass of the class of those graphs G for which the exponential domination number of H equals the domination number of H for every induced subgraph H of G.
Henning Michael A. +2 more
doaj +1 more source
$\mathcal{B}$-Partitions, determinant and permanent of graphs [PDF]
Transactions on Combinatorics, 2018 Let $G$ be a graph (directed or undirected) having $k$ number of blocks $B_1, B_2,\hdots,B_k$. A $\mathcal{B}$-partition of $G$ is a partition consists of $k$ vertex-disjoint subgraph $(\hat{B_1},\hat{B_1},\hdots,\hat{B_k})$ such that $\hat{B}_i$ is an ...
Ranveer Singh, Ravindra Bapat
doaj +1 more source
Steiner Triple Systems With High Discrepancy
Journal of Combinatorial Designs, Volume 34, Issue 1, Page 5-14, January 2026.ABSTRACT In this paper, we initiate the study of discrepancy questions for combinatorial designs. Specifically, we show that, for every fixed r ≥ 3 and n ≡ 1 , 3 ( mod 6 ), any r‐colouring of the triples on [ n ] admits a Steiner triple system of order n with discrepancy Ω ( n 2 ).
Lior Gishboliner +2 more
wiley +1 more source