An introduction to the family members of the architecture Super Strongly Perfect Graph (SSP)

Network is the engineering discipline concerned with the communication between computer systems or devices. A computer network is any set of computers or devices connected to each other with the ability to exchange data. Computers on a network are sometimes called nodes. Networks can be broadly clas...

Full description

Saved in:
Bibliographic Details
Published in2011 International Conference on Emerging Trends in Electrical and Computer Technology pp. 1087 - 1091
Main Authors Jeya Jothi, R Mary, Amutha, A
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.03.2011
Subjects
Architecture
Computer architecture
Computer science
Computers
Cycle
Double Wheel graph
graph
Graph theory
Network
Triangulated graph and Circulant graph
Wheel graph
Wheels
Wireless mesh networks
Online AccessGet full text

Cover

More Information
Summary:Network is the engineering discipline concerned with the communication between computer systems or devices. A computer network is any set of computers or devices connected to each other with the ability to exchange data. Computers on a network are sometimes called nodes. Networks can be broadly classified as using graphs. In the most common sense of the term, a graph is an ordered pair G = (V, E) comprising a set V of vertices or nodes together with a set E of edges or lines, which are 2-element subsets of V. In graph theory, we have many architectures namely Complete graph, Regular graph, Petersen graph, Trees etc. Here we have analyzed one of the new architecture Super Strongly Perfect Graph (SSP). By investigating, we have classified some of its family members namely, Wheel graph, Double Wheel graph, Cycles, Triangulated graphs and Circulant graphs.
ISBN:1424479231
9781424479238
DOI:10.1109/ICETECT.2011.5760280