Results 131 to 140 of about 8,313 (308)
On The Number of Distinct Induced Subgraphs of a Graph
Discrete Mathematics, 1989 Let \(i(G)\) be the number of pairwise non-isomorphic induced subgraphs of graph \(G=\). The graph \(G=\) is \(\ell\)-canonical if there is a partition \(0\) such that for all \(n\) and for all \(G\) with \(n\) vertices \(i(G)\leq \delta n^{k+1}\) it follows that these exists a \(W\subset V\), \(|W| \leq \epsilon n\), such that \(G[V\setminus W]\) is \(
Paul Erdös, András Hajnal
openaire +2 more sources
Survey on Visualization of Information Diffusion over Networks
Computer Graphics Forum, EarlyView.Abstract Information Diffusion (ID) describes how a value (e.g., a pathogen, a rumor, a packet) spreads through an underlying “medium” network of elements (e.g., a social or computer network). Understanding the information diffusion process is essential to predicting trends, controlling misinformation, and enhancing decision‐making as well as ...
T. Baumgartl +8 more
wiley +1 more source
Maximising the number of connected induced subgraphs of unicyclic graphs
, 2022 Audace A. V. Dossou-Olory
openalex +2 more sources
Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph
, 2010 An i-triangulated graph is a graph in which every odd cycle has two non-crossing chords; i-triangulated graphs form a subfamily of perfect graphs. A slightly more general family of perfect graphs are clique-separable graphs.
Addario-Berry, Louigi +4 more
core +1 more source
Pairwise Imitation and Tournament Graphs
International Economic Review, EarlyView.ABSTRACT This paper investigates strategic dynamics under the behavioral rule of pairwise interact and imitate (PII), which requires minimal information and emphasizes outperforming opponents in pairwise interactions. We characterize PII using weak tournament graphs and, for a broad class of dynamics, establish a one‐shot stability result for ...
Sung‐Ha Hwang +3 more
wiley +1 more source
On the number of induced subgraphs of trees
Discrete Mathematics, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Ensuring connectedness for the maximum quasi‐clique and densest k‐subgraph problems
International Transactions in Operational Research, Volume 33, Issue 6, Page 3800-3824, November 2026.Abstract Given an undirected graph G$G$, a quasi‐clique is a subgraph of G$G$ with density at least γ$\gamma$ (0<γ≤1)$(0 < \gamma \le 1)$. Two optimisation problems can be defined for quasi‐cliques: the maximum quasi‐clique (MQC) problem, which finds a quasi‐clique with maximum vertex cardinality, and the densest k$k$‐subgraph (DKS) problem, which ...
Daniela Scherer dos Santos +3 more
wiley +1 more source
Induced subgraphs of graphs with large chromatic number. I. Odd holes [PDF]
, 2014 Alex Scott, Paul Seymour
openalex +1 more source
Induced subgraphs and tree decompositions XII. Grid theorem for pinched graphs [PDF]
, 2023 Bogdan Alecu +3 more
openalex +1 more source
On 3-Colorings of Direct Products of Graphs
Discussiones Mathematicae Graph Theory, 2019 The k-independence number of a graph G, denoted as αk(G), is the order of a largest induced k-colorable subgraph of G. In [S. Špacapan, The k-independence number of direct products of graphs, European J. Combin.
Špacapan Simon
doaj +1 more source