scispace - formally typeset
Open AccessJournal Article

Analysis of regular structures third degree based on chordal rings

Reads0
Chats0
About
This article is published in Image Processing and Communications.The article was published on 2009-04-01 and is currently open access. It has received 7 citations till now. The article focuses on the topics: Chordal graph & Interval graph.

read more

Citations
More filters
Book ChapterDOI

Analysis of Modified Fifth Degree Chordal Rings

TL;DR: Implementation of new telecommunications services has always been associated with the need to ensure network efficiency required to implement these services, and more and better performance is achieved mainly by using more and more advanced technical and technological solutions.
Book ChapterDOI

Network Structures Constructed on Basis of Chordal Rings 4th Degree

TL;DR: The basic parameters (diameter and average path distance) were calculated and described by approximate formulas which makes possible to evaluate these parameters for any modified graph proposed by authors, and it gives possibility to model the properties of these networks without requiring any specific path calculation between pairs of nodes which may be time and resource consuming for large scale systems.
Journal ArticleDOI

Tuchola County Broadband Network (TCBN)

TL;DR: The network plan presented in the paper contains both topological structure of fiber optic network as well as the active equipment for the network, which provides low cost of construction, ease of implementation of the network and low operating cost.
Journal ArticleDOI

The Analysis of the Possibility to Construct Optimal Third-degree Reference Graphs

TL;DR: The subject of this article is to present the results of the analysis of the possibilities to create optimal third-degree Reference Graphs which may be used to model ICT networks.

Network Structures Constructed on Basis of Chordal Rings 4th Degree.

TL;DR: In this paper, the properties of chordal ring 4-degree topologies have been analyzed and two special types of these structures, namely optimal and ideal graphs, have been defined, and the basic parameters (diameter and average path distance) were calculated and described by approximate formulas.
References
More filters
Journal ArticleDOI

Honeycomb networks: Topological properties and communication algorithms

TL;DR: The honeycomb mesh, based on hexagonal plane tessellation, is considered as a multiprocessor interconnection network and honeycomb networks with rhombus and rectangle as the bounding polygons are considered.
Journal ArticleDOI

Analysis of Chordal Ring Network

TL;DR: A family of regular graphs of degree 3, called Chordal Rings, is presented as a possible candidate for the implementation of a local network of message-connected (micro) computers and the diameter of this family is shown to be of 0(n 1/2).
Book

Analysis of chordal ring network

B W Arden, +1 more
TL;DR: In this paper, a family of regular graphs of degree 3, called Chordal Rings, is presented as a possible candidate for the implementation of a local network of message-connected (micro) computers.
Journal ArticleDOI

The groups of the generalized Petersen graphs

TL;DR: In this paper, the generalized Petersen graph G(n, k) was defined for integers n and k with 2 ≤ 2k < n, and G(5, 2) is the well known Petersen graph.