Abstract | ||
---|---|---|
In this paper we establish bounds for the main parameters of parameterized codes associated to the edges of a simple graph $$\\mathcal {G}$$G by using the relationships among these parameters and the corresponding ones of the parameterized codes associated to the edges of any subgraph of $$\\mathcal {G}$$G. These inequalities are used to find bounds in the case of complete r-partite graphs. |
Year | DOI | Venue |
---|---|---|
2015 | 10.1007/s00200-015-0262-7 | Appl. Algebra Eng. Commun. Comput. |
Keywords | Field | DocType |
Toric set,Parameterized code,Hilbert function,Minimum distance,Generalized Hamming weights,Regularity index,94B27,14G50,94B60,13P25 | Discrete mathematics,Graph,Combinatorics,Parameterized complexity,Hilbert series and Hilbert polynomial,Mathematics | Journal |
Volume | Issue | ISSN |
26 | 6 | 0938-1279 |
Citations | PageRank | References |
1 | 0.36 | 5 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Manuel González Sarabia | 1 | 4 | 2.50 |
Eliseo Sarmiento Rosales | 2 | 1 | 0.70 |