Results 81 to 90 of about 6,576,413 (265)
Maximum weighted induced subgraphs
Discrete Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Harant, J., Mohr, S.
openaire +2 more sources
Wind Energy, Volume 29, Issue 3, March 2026.ABSTRACT Wind energy's intermittency poses significant challenges for power grid stability. Existing forecasting methods exhibit notable limitations: traditional machine learning models struggle with long‐term temporal dependencies, while deep learning approaches often overlook spatial relationships among turbines.
YuChen Zhang
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 with distinct sizes [PDF]
Random Structures & Algorithms, 2008 AbstractWe show that for every 0 < ϵ < 1/2, there is an n0 = n0(ϵ) such that if n > n0 then every n‐vertex graph G of size at least $\varepsilon \left( {\matrix{ {\matrix{ n \cr 2 \cr } } \cr } } \right)$ and at most $(1- \varepsilon) \left( {\matrix{ {\matrix{ n \cr 2 \cr } } \cr } } \right)$ contains induced k‐vertex subgraphs with at least ...
Alon, Noga, Kostochka, A. V.
openaire +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
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
Induced subgraphs of prescribed size [PDF]
Journal of Graph Theory, 2003 AbstractA subgraph of a graph G is called trivial if it is either a clique or an independent set. Let q(G) denote the maximum number of vertices in a trivial subgraph of G. Motivated by an open problem of Erdős and McKay we show that every graph G on n vertices for which q(G)≤ C log n contains an induced subgraph with exactly y edges, for every y ...
Alon, Noga +2 more
openaire +2 more sources
Methods in Ecology and Evolution, Volume 17, Issue 2, Page 301-321, February 2026.Abstract Quantifying the structure and dynamics of species interactions in ecological communities is fundamental to studying ecology and evolution. While there are numerous approaches to analysing ecological networks, there is not yet an approach that can (1) quantify dissimilarity in the global structure of ecological networks that range from ...
Kai M. Hung +4 more
wiley +1 more source
Heavy subgraph pairs for traceability of block-chains
Discussiones Mathematicae Graph Theory, 2014 A graph is called traceable if it contains a Hamilton path, i.e., a path containing all its vertices. Let G be a graph on n vertices. We say that an induced subgraph of G is o−1-heavy if it contains two nonadjacent vertices which satisfy an Ore-type ...
Li Binlong +2 more
doaj +1 more source