Results 61 to 70 of about 8,313 (308)
Induced subgraphs of hypercubes
European Journal of Combinatorics, 2013 Let $Q_k$ denote the $k$-dimensional hypercube on $2^k$ vertices. A vertex in a subgraph of $Q_k$ is {\em full} if its degree is $k$. We apply the Kruskal-Katona Theorem to compute the maximum number of full vertices an induced subgraph on $n\leq 2^k$ vertices of $Q_k$ can have, as a function of $k$ and $n$. This is then used to determine $\min(\max(|V(
openaire +2 more sources
Machine Learning Paradigm for Advanced Battery Electrolyte Development
Carbon Energy, EarlyView.Electrolyte materials determine ion transport kinetics within the bulk and interphases, ultimately influencing the performance of battery systems. As data‐driven paradigms increasingly reshape materials discovery, this review provides an application‐oriented exploration of the intersection between machine learning and electrolyte science. By evaluating
Chang Su +4 more
wiley +1 more source
Subgraph Induced Connectivity Augmentation [PDF]
, 2003 Given a planar graph G=(V,E) and a vertex set Wsubseteq V , the subgraph induced planar connectivity augmentation problem asks for a minimum cardinality set F of additional edges with end vertices in W such that G'=(V,Ecup F) is planar and the subgraph ...
Gutwenger, Carsten +5 more
core
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
Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems
, 2022 The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some new approximation algorithms for MIPS are introduced.
G Farr (13134486), K Morgan (13134483)
core +1 more source
Maximum weighted induced subgraphs
Discrete Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jochen Harant, Samuel Mohr
openaire +2 more sources
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
Maximum common subgraph: some upper bound and lower bound results
BMC Bioinformatics, 2006 Background Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this process into a problem of finding a maximum common subgraph between graphical
Jennings Steven F +2 more
doaj +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