Parameterized codes associated to the edges of some subgraphs of a simple graph

In this paper we establish bounds for the main parameters of parameterized codes associated to the edges of a simple graph G by using the relationships among these parameters and the corresponding ones of the parameterized codes associated to the edges of any subgraph of G . These inequalities are u...

Full description

Saved in:
Bibliographic Details
Published in:Applicable algebra in engineering, communication and computing communication and computing, 2015-12, Vol.26 (6), p.493-505
Main Authors: Sarabia, Manuel González, Rosales, Eliseo Sarmiento
Format: Article
Language:English
Subjects:
Artificial Intelligence
Computer Hardware
Computer Science
Original Paper
Symbolic and Algebraic Manipulation
Theory of Computation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we establish bounds for the main parameters of parameterized codes associated to the edges of a simple graph G by using the relationships among these parameters and the corresponding ones of the parameterized codes associated to the edges of any subgraph of G . These inequalities are used to find bounds in the case of complete r -partite graphs.
ISSN:0938-1279
1432-0622
DOI:10.1007/s00200-015-0262-7