SUPER STRONGLY PERFECT NESS OF SOME INTERCONNECTION NETWORKS
Journal Title: Indian Journal of Computer Science and Engineering - Year 2012, Vol 3, Issue 6
Abstract
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 analyzed the structure of super strongly perfect graphs in some Interconnection Networks, like Mesh, Torus, Hyper cubes and Grid Networks. Along with this investigation, we have characterized the Super Strongly Perfect ness in Mesh, Torus, Hyper cubes and Grid Networks. Also we have given the relationship between diameter, domination and co - domination numbers of Mesh, Torus, Hyper cubes and Grid Networks.
Authors and Affiliations
R. Mary Jeya Jothi , A. Amutha
Keywords
Related Articles
- EP ID EP87130
- DOI -
- Views 158
- Downloads 0
EXPLORING GPU MEMORY PERFORMANCE USING DIGITAL IMAGE PROCESSING ALGORITHMS
Leveraging the incredible parallel computational power of graphics processing units (GPUs) is a proven method for accelerating general applications. Efficient utilization of the GPU remains one of the greatest challenges...
PROTOTYPE TO DESIGN A LEASED LINE TELEPHONE NETWORK CONNECTING LOCATIONS TO MINIMIZE THE INSTALLATION COST
Network flows have many real-life applications and leased-line installation for telephone network is one of them. In the leased line a major concern is to provide connection of telephone to all the locations. It is requi...
A SECURITY FRAMEWORK FOR AN ENTERPRISE SYSTEM ON CLOUD
Enterprise systems provide integrated information for all activities in an organization. These systems serve as a vital asset to any organization and hence it becomes mandatory to ensure their security. Information secur...
Disorder Speech Clustering For Clinical Data Using Fuzzy C-Means Clustering And Comparison With SVM Classification
Speech is the most vital skill of communication. Stammering is speech which is hesitant, stumbling, tense or jerky to the extent that it causes anxiety to the speaker. In the existing system, there are many effective tre...
MULTILEVEL HIERARCHICAL DLQ ALGORITHM FOR NETWORK DISCOVERY IN WSN
Neighbour discovery is the determination of all nodes in the network that can communicate with a given node. Routing typically begins with neighbour discovery. Discovering neighbours should be both quick as well as energ...