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

被引：2
|
作者：
Gonzalez Sarabia, Manuel [1 ]
Sarmiento Rosales, Eliseo [2 ]
机构：
[1] UPIITA, Inst Politecn Nacl, Dept Ciencias Basicas, Mexico City 07340, DF, Mexico
[2] ESFM, Inst Politecn Nacl, Dept Matemat, Mexico City 07300, DF, Mexico
来源：
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING | 2015年 / 26卷 / 06期
关键词：
Toric set; Parameterized code; Hilbert function; Minimum distance; Generalized Hamming weights; Regularity index; VANISHING IDEALS;
D O I：
10.1007/s00200-015-0262-7
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
In this paper we establish bounds for the main parameters of parameterized codes associated to the edges of a simple graph by using the relationships among these parameters and the corresponding ones of the parameterized codes associated to the edges of any subgraph of . These inequalities are used to find bounds in the case of complete r-partite graphs.
引用
收藏
页码：493 / 505
页数：13
相关论文
共 50 条
  • [31] Classification of some strongly regular subgraphs of the McLaughlin graph
    Degraer, J.
    Coolsaet, K.
    DISCRETE MATHEMATICS, 2008, 308 (2-3) : 395 - 400
  • [32] The number of edges of the edge polytope of a finite simple graph
    Hibi, Takayuki
    Mori, Aki
    Ohsugi, Hidefumi
    Shikama, Akihiro
    ARS MATHEMATICA CONTEMPORANEA, 2016, 10 (02) : 323 - 332
  • [33] PERFECT CODES IN INDUCED SUBGRAPH OF UNIT GRAPH ASSOCIATED WITH SOME COMMUTATIVE RINGS
    Mudaber, Mohammad Hassan
    Sarmin, Nor Haniza
    Gambo, Ibrahim
    JURNAL TEKNOLOGI-SCIENCES & ENGINEERING, 2022, 84 (05): : 131 - 136
  • [34] PROBLEM OF DIRECTING IN ADVANCE SOME EDGES OF A COMPARABILITY GRAPH
    BURSCHEID, HJ
    MATHEMATISCHE NACHRICHTEN, 1979, 91 : 321 - 325
  • [35] Extension of Some Edge Graph Problems: Standard and Parameterized Complexity
    Casel, Katrin
    Fernau, Henning
    Ghadikolaei, Mehdi Khosravian
    Monnot, Jerome
    Sikora, Florian
    FUNDAMENTALS OF COMPUTATION THEORY, FCT 2019, 2019, 11651 : 185 - 200
  • [36] Preprocessing complexity for some graph problems parameterized by structural parameters
    Lafond, Manuel
    Luo, Weidong
    DISCRETE APPLIED MATHEMATICS, 2025, 371 : 46 - 59
  • [37] Preprocessing complexity for some graph problems parameterized by structural parameters
    Lafond, Manuel
    Luo, Weidong
    XII LATIN-AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, LAGOS 2023, 2023, 224 : 130 - 139
  • [38] Parameterized algorithms and hardness results for some graph motif problems
    Betzler, Nadja
    Fellows, Michael R.
    Komusiewicz, Christian
    Niedermeier, Rolf
    COMBINATORIAL PATTERN MATCHING, 2008, 5029 : 31 - +
  • [39] Some Simple Observations on Lattice Codes
    Vehkalahti, Roope
    2009 IEEE INFORMATION THEORY WORKSHOP (ITW 2009), 2009, : 223 - 227
  • [40] Parameterized codes over some embedded sets and their applications to complete graphs
    Gonzalez Sarabia, Manuel
    Renteria Marquez, Carlos
    Sarmiento Rosales, Eliseo
    MATHEMATICAL COMMUNICATIONS, 2013, 18 (02) : 377 - 391
12345