Results 11 to 20 of about 505,548 (331)
Tight upper bound on the maximum anti-forcing numbers of graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 Let $G$ be a simple graph with a perfect matching. Deng and Zhang showed that the maximum anti-forcing number of $G$ is no more than the cyclomatic number.
Lingjuan Shi, Heping Zhang
doaj +3 more sources
Fullerene graphs have exponentially many perfect matchings [PDF]
, 2008 A fullerene graph is a planar cubic 3-connected graph with only pentagonal and hexagonal faces.
František Kardoš +3 more
openalex +3 more sources
An Ore-type theorem for perfect packings in graphs
, 2008 We say that a graph G has a perfect H-packing (also called an H-factor) if there exists a set of disjoint copies of H in G which together cover all the vertices of G.
Daniela Kühn +2 more
openalex +5 more sources
Tilings in randomly perturbed dense graphs [PDF]
, 2018 A perfect $H$-tiling in a graph $G$ is a collection of vertex-disjoint copies of a graph $H$ in $G$ that together cover all the vertices in $G$. In this paper we investigate perfect $H$-tilings in a random graph model introduced by Bohman, Frieze and ...
Balogh, József +2 more
core +2 more sources
A semi-strong perfect digraph theorem
AKCE International Journal of Graphs and Combinatorics, 2020 Reed (1987) showed that, if two graphs are P4-isomorphic, then either both are perfect or none of them is. In this note, we will derive an analogous result for perfect digraphs.
Stephan Dominique Andres +3 more
doaj +1 more source
Perfect state transfer, graph products and equitable partitions [PDF]
, 2010 We describe new constructions of graphs which exhibit perfect state transfer on continuous-time quantum walks. Our constructions are based on variants of the double cones [BCMS09,ANOPRT10,ANOPRT09] and the Cartesian graph products (which includes the n ...
Ge Yang +3 more
openalex +4 more sources
Compositions for perfect graphs [PDF]
Discrete Mathematics, 1985 In this paper we introduce a new graph composition, called 2-amalgam, and we prove that the 2-amalgam of perfect graphs is perfect. This composition generalizes many of the operations known to preserve perfection, such as the clique identification, substitution, join and amalgam operations.
Gérard Cornuéjols +1 more
openaire +1 more source
Perfect Fuzzy Soft Tripartite Graphs and Their Complements
Discrete Dynamics in Nature and Society, 2022 Fuzzy soft graphs are efficient numerical tools for simulating the uncertainty of the real world. A fuzzy soft graph is a perfect fusion of the fuzzy soft set and the graph model that is widely used in a variety of fields.
Kalaichelvan Kalaiarasi +4 more
doaj +1 more source
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles [PDF]
, 2019 Motivated by adjacency in perfect matching polytopes, we study the shortest reconfiguration problem of perfect matchings via alternating cycles. Namely, we want to find a shortest sequence of perfect matchings which transforms one given perfect matching ...
Ito, Takehiro +4 more
core +2 more sources
On very strongly perfect Cartesian product graphs
AIMS Mathematics, 2022 Let $ G_1 \square G_2 $ be the Cartesian product of simple, connected and finite graphs $ G_1 $ and $ G_2 $. We give necessary and sufficient conditions for the Cartesian product of graphs to be very strongly perfect.
Ganesh Gandal +2 more
doaj +1 more source