Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Characterization of Super Strongly Perfect Graphs in Chordal and Strongly Chordal Graphs
View through CrossRef
A Graph G is Super Strongly Perfect Graph if every induced sub graph H of G possesses a minimal dominating set that meets all the maximal complete sub graphs of H. In this paper, we have investigated the characterization of Super Strongly Perfect graphs using odd cycles. We have given the characterization of Super Strongly Perfect graphs in chordal and strongly chordal graphs. We have presented the results of Chordal graphs in terms of domination and co - domination numbers γ and . We have given the relationship between diameter, domination and co - domination numbers of chordal graphs. Also we have analysed the structure of Super Strongly Perfect Graph in Chordal graphs and Strongly Chordal graphs.
Title: Characterization of Super Strongly Perfect Graphs in Chordal and Strongly Chordal Graphs
Description:
A Graph G is Super Strongly Perfect Graph if every induced sub graph H of G possesses a minimal dominating set that meets all the maximal complete sub graphs of H.
In this paper, we have investigated the characterization of Super Strongly Perfect graphs using odd cycles.
We have given the characterization of Super Strongly Perfect graphs in chordal and strongly chordal graphs.
We have presented the results of Chordal graphs in terms of domination and co - domination numbers γ and .
We have given the relationship between diameter, domination and co - domination numbers of chordal graphs.
Also we have analysed the structure of Super Strongly Perfect Graph in Chordal graphs and Strongly Chordal graphs.
Related Results
Magic graphs
Magic graphs
DE LA TESIS<br/>Si un graf G admet un etiquetament super edge magic, aleshores G es diu que és un graf super edge màgic. La tesis està principalment enfocada a l'estudi del c...
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Abstract
Chordal graphs are characterized as the intersection graphs of subtrees in a tree and such a representation is known as the tree model. Restricting the characteriz...
Product of digraphs, (super) edge-magic valences and related problems
Product of digraphs, (super) edge-magic valences and related problems
Discrete Mathematics, and in particular Graph Theory, has gained a lot of popularity during the last 7 decades. Among the many branches in Graph Theory, graph labelings has experim...
[RETRACTED] ACV Super Slim Gummies Reviews Scam Or Legit Updated 2022 – Must-See Worth Buying? v1
[RETRACTED] ACV Super Slim Gummies Reviews Scam Or Legit Updated 2022 – Must-See Worth Buying? v1
[RETRACTED]➪ACV Super Slim Gummies - Official Website Link - Click Here To Buy❤️ ✪Product Name ➯ ACV Super Slim Gummies UK✪Main Benefits ➯ Can help you with all your overweight i...
[RETRACTED] ACV Super Slim Gummies Reviews Scam Or Legit Updated 2022 – Must-See Worth Buying? v1
[RETRACTED] ACV Super Slim Gummies Reviews Scam Or Legit Updated 2022 – Must-See Worth Buying? v1
[RETRACTED]➪ACV Super Slim Gummies - Official Website Link - Click Here To Buy❤️ ✪Product Name ➯ ACV Super Slim Gummies UK✪Main Benefits ➯ Can help you with all your overweight i...
Quantitative nanoscale imaging of synaptic protein organization
Quantitative nanoscale imaging of synaptic protein organization
The arrival of super-resolution techniques has driven researchers to explore biological areas that were unreachable before. Such techniques not only allowed the improvement of spat...
Super-lncRNAs: identification of lncRNAs that target super-enhancers via RNA:DNA:DNA triplex formation
Super-lncRNAs: identification of lncRNAs that target super-enhancers via RNA:DNA:DNA triplex formation
Super-enhancers are characterized by high levels of Mediator binding and are major contributors to the expression of their associated genes. They exhibit high levels of local chrom...
Hardness and algorithmic results for Roman \{3\}-domination
Hardness and algorithmic results for Roman \{3\}-domination
A Roman $\{3\}$-dominating function on a graph $G = (V, E)$ is a function $f: V \rightarrow \{0, 1, 2, 3\}$ such that for each vertex $u \in V$, if $f(u) = 0$ then $\sum\limits_{v ...