Results 11 to 20 of about 1,679,013 (321)
Strong Perfect Cobondage Number of Standard Graphs
Ratio Mathematica, 2023 Let G be a simple graph. A subset S Í V(G) is called a strong (weak) perfect dominating set of G if |Ns(u) ∩ S| = 1(|Nw(u) ∩ S| = 1) for every u ∊V(G) - S where Ns(u) = {v ∊ V(G) / uv deg v ≥ deg u} (Nw(u) = {v ∊V(G) / uv deg v ≤ deg u}.
T. S Govindalakshmi, N Meena
doaj +1 more source
The Chromatic Symmetric Functions of Trivially Perfect Graphs and Cographs [PDF]
Graphs and Combinatorics, 2017 Richard P. Stanley defined the chromatic symmetric function of a simple graph and has conjectured that every tree is determined by its chromatic symmetric function.
S. Tsujie
semanticscholar +1 more source
Perfect double Italian domination of a graph
AKCE International Journal of Graphs and Combinatorics, 2023 For a graph [Formula: see text] with [Formula: see text] and [Formula: see text], a perfect double Italian dominating function is a function [Formula: see text] having the property that [Formula: see text], for every vertex [Formula: see text] with ...
Guoliang Hao +2 more
doaj +1 more source
Total perfect codes in graphs realized by commutative rings [PDF]
Transactions on Combinatorics, 2022 Let $R$ be a commutative ring with unity not equal to zero and let $\Gamma(R)$ be a zero-divisor graph realized by $R$. For a simple, undirected, connected graph $G = (V, E)$, a {\it total perfect code} denoted by $C(G)$ in $G$ is a subset $C(G ...
Rameez Raja
doaj +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
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
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
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