Results 121 to 130 of about 5,057 (262)
Some Variations of Perfect Graphs
Discussiones Mathematicae Graph Theory, 2016 We consider (ψk−γk−1)-perfect graphs, i.e., graphs G for which ψk(H) = γk−1(H) for any induced subgraph H of G, where ψk and γk−1 are the k-path vertex cover number and the distance (k − 1)-domination number, respectively.
Dettlaff Magda +3 more
doaj +1 more source
Cyclomatic numbers of connected induced subgraphs
, 1992 We give an upper bound for ω(A), the minimum cyclomatic number of connected induced subgraphs containing a given independent set A of vertices in a given graph G. We also give an upper bound for ω(A) when G is triangle-free. We show that these two bounds
Yu, Xingxing
core +1 more source
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
Special MatricesFor the graphs GG and HH, the spectral deviation of HH from GG is defined as ϱG(H)=∑μ∈Hminλ∈G∣λ−μ∣,{\varrho }_{G}\left(H)=\sum _{\mu \in H}\mathop{\min }\limits_{\lambda \in G}| \lambda -\mu | , where ∈\in designates that the given number is an ...
Stanić Zoran
doaj +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
Unavoidable Induced Subgraphs of Large Graphs
, 2014 A theorem of Galvin, Rival and Sands [5] states that every graph with a large path contains either a large induced path or a large complete bipartite subgraph (not necessarily induced).
Pohoata, Andrei Cosmin
core
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
Transforming Solutions for the Oberwolfach Problem into Solutions for the Spouse‐Loving Variant
Journal of Combinatorial Designs, Volume 34, Issue 8, Page 361-377, August 2026.ABSTRACT The Oberwolfach problem OP ( F ), for a 2‐factor F of K n, asks whether there exists a 2‐factorization of K n (if n is odd) or K n − I (if n is even) where each 2‐factor is isomorphic to F. Here, I denotes any 1‐factor of K n. For even n, the problem OP ( F ) may also be denoted OP − ( F ), and has been nicknamed the spouse‐avoiding variant ...
Maruša Lekše, Mateja Šajna
wiley +1 more source