Results 11 to 20 of about 520,977 (330)
Fractional matching preclusion for generalized augmented cubes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 The \emph{matching preclusion number} of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings.
Tianlong Ma +3 more
doaj +1 more source
Parameters of the coprime graph of a group [PDF]
International Journal of Group Theory, 2021 There are many different graphs one can associate to a group. Some examples are the well-known Cayley graph, the zero divisor graph (of a ring), the power graph, and the recently introduced coprime graph of a group.
Jessie Hamm, Alan Way
doaj +1 more source
On two consequences of Berge–Fulkerson conjecture
AKCE International Journal of Graphs and Combinatorics, 2020 The classical Berge–Fulkerson conjecture states that any bridgeless cubic graph admits a list of six perfect matchings such that each edge of belongs to two of the perfect matchings from the list.
Vahan V. Mkrtchyan, Gagik N. Vardanyan
doaj +1 more source
Two short proofs of the Perfect Forest Theorem
Theory and Applications of Graphs, 2017 A perfect forest is a spanning forest of a connected graph $G$, all of whose components are induced subgraphs of $G$ and such that all vertices have odd degree in the forest.
Yair Caro, Josef Lauri, Christina Zarb
doaj +1 more source
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
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
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
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
Random Structures & Algorithms, 2018 We investigate the asymptotic structure of a random perfect graph Pn sampled uniformly from the set of perfect graphs on vertex set . Our approach is based on the result of Prömel and Steger that almost all perfect graphs are generalised split graphs, together with a method to generate such graphs almost uniformly.
McDiarmid, C, Yolov, N
openaire +2 more sources
Characterizing ‐perfect line graphs [PDF]
International Transactions in Operational Research, 2016 AbstractThe aim of this paper is to study the Lovász‐Schrijver PSD operator applied to the edge relaxation of the stable set polytope of a graph. We are particularly interested in the problem of characterizing graphs for which generates the stable set polytope in one step, called ‐perfect graphs.
Escalante, Mariana Silvina +2 more
openaire +5 more sources