Results 21 to 30 of about 1,716,586 (315)
On the expected number of perfect matchings in cubic planar graphs [PDF]
, 2021 A well-known conjecture by Lov\'asz and Plummer from the 1970s asserted that a bridgeless cubic graph has exponentially many perfect matchings. It was solved in the affirmative by Esperet et al. (Adv. Math. 2011).
Noy, Marc +2 more
core +3 more sources
Perfect Elimination Orderings for Symmetric Matrices [PDF]
, 2017 We introduce a new class of structured symmetric matrices by extending the notion of perfect elimination ordering from graphs to weighted graphs or matrices.
Laurent, Monique, Tanigawa, Shin-ichi
core +12 more sources
AKCE International Journal of Graphs and Combinatorics, 2020 A graph of order is domatically perfect if , where and denote the domination number and the domatic number, respectively. In this paper, we give basic results for domatically perfect graphs, and study a main problem; for a given graph , to find a ...
Naoki Matsumoto
doaj +1 more source
Exploration of CPCD number for power graph
مجلة بغداد للعلوم, 2023 Recently, complementary perfect corona domination in graphs was introduced. A dominating set S of a graph G is said to be a complementary perfect corona dominating set (CPCD – set) if each vertex in is either a pendent vertex or a support vertex and ...
S. Anuthiya, G. Mahadevan, C. Sivagnanam
doaj +1 more source
Reflexive polytopes arising from partially ordered sets and perfect graphs [PDF]
, 2017 Reflexive polytopes which have the integer decomposition property are of interest. Recently, some large classes of reflexive polytopes with integer decomposition property coming from the order polytopes and the chain polytopes of finite partially ordered
T. Hibi, Akiyoshi Tsuchiya
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
Spectra of perfect state transfer Hamiltonians on fractal-like graphs [PDF]
Journal of Physics A: Mathematical and Theoretical, 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
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