Results 11 to 20 of about 916,150 (184)
Why are they called Trivially Perfect Graphs?
Cadernos do IME - Série Informática, 2022 Trivially perfect graphs are graphs for which the stability number equals the number of (maximal) cliques, for every induced subgraph. Trivially perfect graphs are equivalent to the {C_4, P_4}-free graphs, and to the comparability graphs orders whose Hasse diagram is a rooted tree.
Golumbic, Martin Charles
openaire +2 more sources
Structural Divergence Between the Moltbook AI-Agent Network and Human Social Networks. [PDF]
Adv Sci (Weinh)Analysis of the Moltbook AI‐agent network reveals a striking combination of familiar global scaling and distinct internal organization. Attention is highly concentrated, reciprocity is limited, connected triads are suppressed, and communities are strongly modular.
Hou W, Ji Z.
europepmc +2 more sources
An improved kernelization algorithm for Trivially Perfect Editing [PDF]
, 2023 In the Trivially Perfect Editing problem one is given an undirected graph $G = (V,E)$ and an integer $k$ and seeks to add or delete at most $k$ edges in $G$ to obtain a trivially perfect graph.
Dumas, Maël, Perez, Anthony
core +4 more sources
Triple Connected Domination Number of a Graph [PDF]
, 2012 The concept of triple connected graphs with real life application was introduced by considering the existence of a path containing any three vertices of a graph G.
Selvam Avadayappan +7 more
core +1 more source
Trivially noncontractible edges in a contraction critically 5-connected graph [PDF]
, 2005 An edge of a k-connected graph is said to be k-contractible if the contraction of the edge results in a k-connected graph. A k-connected graph with no k-contractible edge is said to be contraction critically k-connected. An edge of a k-connected graph is
Ando, Kiyoshi
core +1 more source
STRONG KOSZULNESS OF TORIC RINGS ASSOCIATED WITH STABLE SET POLYTOPES OF TRIVIALLY PERFECT GRAPHS [PDF]
Journal of Algebra and Its Applications, 2014 We give necessary and sufficient conditions for strong Koszulness of toric rings associated with stable set polytopes of graphs.
openaire +3 more sources
Certifying Induced Subgraphs in Large Graphs
Journal of Graph Algorithms and ApplicationsWe introduce I/O-efficient certifying algorithms for the recognition of bipartite, split, threshold, bipartite chain, and trivially perfect graphs. When the input graph is a member of the respective class, the certifying algorithm returns a certificate
Ulrich Meyer +2 more
doaj +1 more source
Computing Optimal Leaf Roots of Chordal Cographs in Linear Time
Journal of Graph Algorithms and ApplicationsA graph $G$ is a $k$-leaf power, for an integer $k \geq 2$, if there is a tree $T$ with leaf set $V(G)$ such that, for all distinct vertices $x, y \in V(G)$, the edge $xy$ exists in $G$ if and only if the distance between $x$ and $y$ in $T$ is at most $k$
Van Bang Le, Christian Rosenke
doaj +1 more source
Data‐Driven Materials Science for Energy‐Sustainable Applications
Advanced Materials, EarlyView.Data‐driven approaches powered by artificial intelligence are transforming materials discovery for energy sustainability. This review examines how auto‐generated high‐quality materials databases and domain‐specific language models accelerate research in photovoltaics, thermoelectrics, batteries and magnetic materials. Applications involve extraction of
Jacqueline M. Cole
wiley +1 more source
ML Workflows for Screening Degradation‐Relevant Properties of Forever Chemicals
Advanced Science, EarlyView.The environmental persistence of per‐ and polyfluoroalkyl substances (PFAS) necessitates efficient remediation strategies. This study presents physics‐informed machine learning workflows that accurately predict critical degradation properties, including bond dissociation energies and polarizability.
Pranoy Ray +3 more
wiley +1 more source