Results 21 to 30 of about 1,679,013 (321)
Spectra of perfect state transfer Hamiltonians on fractal-like graphs [PDF]
arXiv.org, 2020 In this paper we study the spectral features, on fractal-like graphs, of Hamiltonians which exhibit the special property of perfect quantum state transfer (PQST): the transmission of quantum states without dissipation.
Gamal Mograby +3 more
semanticscholar +1 more source
Clique-Stable Set separation in perfect graphs with no balanced skew-partitions [PDF]
, 2016 Inspired by a question of Yannakakis on the Vertex Packing polytope of perfect graphs, we study the Clique-Stable Set Separation in a non-hereditary subclass of perfect graphs.
Lagoutte, Aurélie, Trunck, Théophile
core +4 more sources
Planar cycle-extendable graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceFor most problems pertaining to perfect matchings, one may restrict attention to matching covered graphs - that is, connected nontrivial graphs with the property that each edge belongs to some perfect matching.
Aditya Y Dalwadi +3 more
doaj +1 more source
All Pairs of Pentagons in Leapfrog Fullerenes Are Nice
Mathematics, 2020 A subgraph H of a graph G with perfect matching is nice if G−V(H) has perfect matching. It is well-known that all fullerene graphs have perfect matchings and that all fullerene graphs contain some small connected graphs as nice subgraphs.
Tomislav Došlić
doaj +1 more source
Balancedness of subclasses of circular-arc graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Graph ...
Flavia Bonomo +3 more
doaj +1 more source
Bounding Clique-Width via Perfect Graphs [PDF]
Language and Automata Theory and Applications, 2014 Given two graphs $H_1$ and $H_2$, a graph $G$ is $(H_1,H_2)$-free if it contains no subgraph isomorphic to $H_1$ or $H_2$. We continue a recent study into the clique-width of $(H_1,H_2)$-free graphs and present three new classes of $(H_1,H_2)$-free ...
Konrad Dabrowski +2 more
semanticscholar +1 more source
Head-to-Tail: How Knowledgeable are Large Language Models (LLMs)? A.K.A. Will LLMs Replace Knowledge Graphs? [PDF]
North American Chapter of the Association for Computational Linguistics, 2023 Since the recent prosperity of Large Language Models (LLMs), there have been interleaved discussions regarding how to reduce hallucinations from LLM responses, how to increase the factuality of LLMs, and whether Knowledge Graphs (KGs), which store the ...
Kai Sun +4 more
semanticscholar +1 more source
Perfect Codes in Cayley Sum Graphs [PDF]
Electronic Journal of Combinatorics, 2020 A subset $C$ of the vertex set of a graph $\Gamma$ is called a perfect code of $\Gamma$ if every vertex of $\Gamma$ is at distance no more than one to exactly one vertex in $C$. Let $A$ be a finite abelian group and $T$ a square-free subset of $A$.
Xuanlong Ma, Kaishun Wang, Yuefeng Yang
semanticscholar +1 more source
Line game-perfect graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceThe $[X,Y]$-edge colouring game is played with a set of $k$ colours on a graph $G$ with initially uncoloured edges by two players, Alice (A) and Bob (B). The players move alternately. Player $X\in\{A,B\}$ has the first move. $Y\in\{A,B,-\}$.
Stephan Dominique Andres, Wai Lam Fong
doaj +1 more source
The Windy Postman Problem on Series-Parallel Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 The windy postman problem is the NP-hard problem of finding the minimum cost of a tour traversing all edges of an undirected graph, where the cost of traversal of an edge depends on the direction. Given an undirected graph $G$, we consider the polyhedron
Francisco Javier Zaragoza Martínez
doaj +1 more source