*Five Years Citation in Google scholar (2016 - 2020) is. 1451*   *    IJPR IS INDEXED IN ELSEVIER EMBASE & EBSCO *       

logo

INTERNATIONAL JOURNAL OF PHARMACEUTICAL RESEARCH

A Step Towards Excellence
Published by : Advanced Scientific Research
ISSN
0975-2366
Current Issue
No Data found.
Article In Press
No Data found.
ADOBE READER

(Require Adobe Acrobat Reader to open, If you don't have Adobe Acrobat Reader)

Index Page 1
Click here to Download
IJPR 9[3] July - September 2017 Special Issue

July - September 9[3] 2017

Click to download
 

Article Detail

Label
Label
Characterization of Graphs with Maximum Degree and Tree Dom Strong Domination Number

Author: M. MEERAL, P. MUNIAPPAN, S. GAYATHRI DEVI
Abstract: In graph theory, domination is the major area which attracts researchers due to its potential to solve many real life problems. Particularly, tree dom strong domination solves problems involving design and analysis of communication network and social network. For everywhere DS is a Dom strong dominating set (Dsd-set), there exists such that, and the minimum cardinality of a Dsd-set is denoted by. A Dsd-set of a graph is a tree dom strong dominating set (trdsd set) if the induced subgraph is a tree. The minimum cardinality taken over all tree dom strong dominating sets is denoted by ( ). The sum of the tree dom strong domination number and maximum degree of graphs equal to is studied and characterized the corresponding extremal graphs.
Keyword: Dom Strong Domination Number, Tree Dom Strong Domination Number, Maximum Degree.
DOI: https://doi.org/10.31838/ijpr/2020.12.03.286
Download: Request For Article
 
Clients

Clients

Clients

Clients

Clients
ONLINE SUBMISSION
USER LOGIN


Username
Password
Login | Register
News & Events
SCImago Journal & Country Rank

Terms and Conditions
Disclaimer
Refund Policy
Instrucations for Subscribers
Privacy Policy

Copyrights Form

0.12
2018CiteScore
 
8th percentile
Powered by  Scopus
Google Scholar

hit counters free