Results 21 to 30 of about 43,364 (297)
On clique-perfect and K-perfect graphs.
Ars Comb., 2006 80
Bonomo, Flavia +3 more
openaire +5 more sources
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
An induced subgraph characterization of domination perfect graphs [PDF]
, 1995 Let γ(G) ι(G) be the domination number and independent domination number of a graph (G), respectively. A graph (G) is called domination perfect if γ(H) = ι(H), for every induced subgraph H of (G).
Vadim E. Zverovich +5 more
core +1 more source
Weakly Perfect Graphs of Modules [PDF]
Control and Optimization in Applied Mathematics, 2019 In this study, $R$ and $M$ are assumed to be a commutative ring with non-zero identity $M$ and an $R$-module, respectively. Scalar Product Graph of $M$, denoted by $G_R(M)$, is a graph with the vertex-set $M$ and two different vertices $a$ and $b$ in $M$
Mostafa Nouri Jouybari +2 more
doaj +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
Independent sets of maximum weight in apple-free graphs [PDF]
, 2010 We present the first polynomial-time algorithm to solve the maximum weight independent set problem for apple-free graphs, which is a common generalization of several important classes where the problem can be solved efficiently, such as claw-free graphs,
Lozin, Vadim V. +2 more
core +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
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
Perfectness of clustered graphs [PDF]
Discrete Optimization, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Flavia Bonomo +3 more
openaire +3 more sources