Results 61 to 70 of about 5,057 (262)
The effect of induced subgraphs on quasi‐randomness [PDF]
Random Structures & Algorithms, 2009 AbstractOne of the main questions that arise when studying random and quasi‐random structures is which properties $ \cal P$ are such that any object that satisfies $ \cal P$ “behaves” like a truly random one. In the context of graphs, Chung, Graham, and Wilson (Combinatorica 9 (1989), 345–362) call a graph p‐quasi‐random if it satisfies a long list of ...
Asaf Shapira, Raphael Yuster
openaire +4 more sources
Communications on Pure and Applied Mathematics, EarlyView.ABSTRACT The leading‐order asymptotic behavior of the solution of the Cauchy initial‐value problem for the Benjamin–Ono equation in L2(R)$L^2(\mathbb {R})$ is obtained explicitly for generic rational initial data u0$u_0$. An explicit asymptotic wave profile uZD(t,x;ε)$u^\mathrm{ZD}(t,x;\epsilon)$ is given, in terms of the branches of the multivalued ...
Elliot Blackstone +3 more
wiley +1 more source
A ramsey-type theorem for multiple disjoint copies of induced subgraphs
Discussiones Mathematicae Graph Theory, 2014 Let k and ℓ be positive integers with ℓ ≤ k − 2. It is proved that there exists a positive integer c depending on k and ℓ such that every graph of order (2k−1−ℓ/k)n+c contains n vertex disjoint induced subgraphs, where these subgraphs are isomorphic to ...
Nakamigawa Tomoki
doaj +1 more source
Line Graphs and Forbidden Induced Subgraphs
, 2001 Beineke and Robertson independently characterized line graphs in terms of nine forbidden induced subgraphs. In 1994, Šoltés gave another characterization, which reduces the number of forbidden induced subgraphs to seven, with only five exceptional cases.
Lai, Hong-Jian, Šoltés, Ľubomír
core +1 more source
Perfect codes in the spanning and induced subgraphs of the unity product graph [PDF]
, 2022 The unity product graph of a ring R is a graph which is obtained by setting the set of unit elements of R as the vertex set. The two distinct vertices ri and rj are joined by an edge if and only if ri · rj = e.
Sarmin, Nor Haniza +2 more
core +1 more source
Domination properties and induced subgraphs
Discrete Mathematics, 1993 Two types of classes of graphs are studied. The class \(\text{Forb}(C_ t,P_ t)\) is the class of all graphs which contain no induced subgraph isomorphic to the circuit \(C_ t\) with \(t\) vertices or to the path \(P_ t\) with \(t\) vertices. The class \(\text{Dom}(d,k)\) is the class of graphs \(G\) in which every connected induced subgraph \(H ...
Gábor Bacsó, Zsolt Tuza
openaire +2 more sources
iMetaOmics, EarlyView.Comprehensive understanding of how diverse PGPR strains enhance the rhizosphere microenvironment remains a considerable challenge. Here, we provide experimental evidence that a functionally synergistic composite microbial formulation can markedly enhance growth performance and improve the quality attributes in Angelica sinensis.
Zongyu Zhang +13 more
wiley +1 more source
Hereditary Equality of Domination and Exponential Domination in Subcubic Graphs
Discussiones Mathematicae Graph Theory, 2021 Let γ(G) and γe(G) denote the domination number and exponential domination number of graph G, respectively. Henning et al., in [Hereditary equality of domination and exponential domination, Discuss. Math. Graph Theory 38 (2018) 275–285] gave a conjecture:
Chen Xue-Gang, Wang Yu-Feng, Wu Xiao-Fei
doaj +1 more source
Fast Approximate Convex Hull Construction in Networks via Node Embedding
IEEE Access, 2023 Geodesic convexity in networks is an intrinsic property of graphs. It aids in distinguishing between real-world networks and random graphs. One possible application is recommending new connections in a collaborative network by searching for them in the ...
Dmitrii Gavrilev, Ilya Makarov
doaj +1 more source
Large induced degenerate subgraphs
Graphs and Combinatorics, 1987 A graph G is called d-degenerate (for a positive integer d), if every non-empty subgraph of G contains a vertex of degree smaller than d. The symbol \(\alpha_ d(G)\) denotes the maximum number of vertices of an induced d-degenerate subgraph of G. Further \(e_ d(n,m)\) is the minimum number of edges of a graph G with n vertices and with \(\alpha_ d(G)=m\
Noga Alon +2 more
openaire +2 more sources