Results 111 to 120 of about 64,086 (307)
On connected components and perfect codes of proper order graphs of finite groups [PDF]
Proceedings of the Estonian Academy of SciencesLet G be a finite group with the identity element e. The proper order graph of G, denoted by â* (G), is an undirected graph with a vertex set G \ {e}, where two distinct vertices x and y are adjacent whenever o(x) | o(y) or o(y) | o(x), where o(x) and ...
Huani Li, Shixun Lin, Xuanlong Ma
doaj +1 more source
The Simple Geometry of Perfect Information Games [PDF]
Perfect information games have a particularly simple structure of equilibria in the associated normal form. For generic such games each of the finitely many connected components of Nash equilibria is contractible. For every perfect information game there
Demichelis, Stefano +2 more
core
Discrete Mathematics, 1986 Let G be a graph. The authors denote by \(\alpha_ N(G)\) the maximum number of edges of G such that no two of them belong to the same neighborhood subgraph of G (that is a subgraph induced by a vertex v and the vertices adjacent to v). They denote by \(\rho_ N(G)\) the minimum number of vertices whose neighborhood subgraphs cover the edge set of G.
Jenö Lehel, Zsolt Tuza
openaire +1 more source
At Most Twin Outer Perfect Domination Number Of A Graph
, 2021 A Set In A Graph G Is Said To Be At Most Twin Outer Perfect Dominating Set If For Every Vertex , And Has At Least One Perfect Matching.
et. al., G. Mahadevan,
core +1 more source
Layered Nanoporous Platforms for SERS Sensing
Advanced Materials Interfaces, EarlyView.Here, we present a detailed investigation of the SERS performance of layered nanoporous metals. The controlled deposition of well‐defined, stacked porous layers enabled a systematic analysis of the effects of multimetallic systems in SERS experiments. Numerical models are also used to support the experimental findings.
Yanqiu Zou +18 more
wiley +1 more source
Decomposing Berge graphs [PDF]
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no old hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seymour and Thomas proved a decomposition theorem for Berge graphs saying that ...
Nicolas Trotignon
core
The Strong Perfect Graph Conjecture for pan-free graphs
, 1989 A graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals the largest number ω(F) of pairwise adjacent vertices in F.
Olariu, Stephan
core +1 more source
Advanced Materials Technologies, EarlyView.Left: Illustration of the glass & nanostructures system and the NIR emission at 1.5 µm, where the colored spheres represent the Er3+ ions within the doped glass. Right: Representation of the Stark splitting of the 4I13/2 and 4I15/2 manifolds of the Er3+, illustrating how the plasmonic modes facilitate the emission from the broader Stark manifold ...
Gaston Lozano Calderón +5 more
wiley +1 more source
Electronic Journal of Graph Theory and Applications\noindent A perfect dominating set in a graph $G=(V,E)$ is a subset $S \subseteq V$ such that each vertex in $V \setminus S$ has exactly one neighbor in $S$. A perfect coalition in $G$ consists of two disjoint sets of vertices $V_i$ and $V_j$ such that i) neither $V_i$ nor $V_j$ is a dominating set, ii) each vertex in $V(G) \setminus V_i$ has at most ...
Doost Ali Mojdeh +1 more
openaire +2 more sources
Grounding Large Language Models for Robot Task Planning Using Closed‐Loop State Feedback
Advanced Robotics Research, EarlyView.BrainBody‐Large Language Model (LLM) introduces a hierarchical, feedback‐driven planning framework where two LLMs coordinate high‐level reasoning and low‐level control for robotic tasks. By grounding decisions in real‐time state feedback, it reduces hallucinations and improves task reliability.
Vineet Bhat +4 more
wiley +1 more source