2021
DOI: 10.1088/1742-6596/1770/1/012085
|View full text |Cite
|
Sign up to set email alerts
|

SSP-Structure of k-Sun Flower, Friendship and Jahangir Graphs

Abstract: A graph is SSP (Super Strongly Perfect) if all of its (induced) subgraph H in G obsesses a (minimal dominating set) MDS that link up all of its cliques (maximal) in H. It is offered the cyclic structure of k-sun flower graph, friendship and Jahangir graphs and later explored their SSP parameters like counting of colourability, MDS (minimal dominating set) and cliques (maximal) of these graphs.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…Our purpose, in this paper, gives definitions, results, and examples of Wiener polynomial and index for subdivision graphs of friendship and bifriendship graphs and line graph subdivision graphs of friendship and bifriendship graphs. We refer the interested reader to [12,29]. Any graph in this paper is a simple graph.…”
Section: Introductionmentioning
confidence: 99%
“…Our purpose, in this paper, gives definitions, results, and examples of Wiener polynomial and index for subdivision graphs of friendship and bifriendship graphs and line graph subdivision graphs of friendship and bifriendship graphs. We refer the interested reader to [12,29]. Any graph in this paper is a simple graph.…”
Section: Introductionmentioning
confidence: 99%