The linear guessing number of undirected graphs

被引：2

作者：

Chang, Gerard Jennhwa ^{[1
,2
,3
]}

Feng, Keqin ^{[4
]}

Huang, Liang-Hao ^{[5
]}

Lu, Mei ^{[4
]}

机构：

[1] Natl Taiwan Univ, Dept Math, Taipei 10617, Taiwan

[2] Natl Taiwan Univ, Taida Inst Math Sci, Taipei 10617, Taiwan

[3] Natl Ctr Theoret Sci, Taipei Off, Hsinchu, Taiwan

[4] Tsinghua Univ, Dept Math Sci, Beijing 100084, Peoples R China

[5] Acad Sinica, Res Ctr Informat Technol Innovat, Taipei 115, Taiwan

来源：

LINEAR ALGEBRA AND ITS APPLICATIONS | 2014年 / 449卷

基金：

中国国家自然科学基金;

关键词：

Linear guessing number; Undirected graph; Network coding;

D O I：

10.1016/j.laa.2014.02.010

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

This paper investigates linear guessing number introduced by Riis in connection with the network coding theory. This paper establishes properties of linear guessing number on undirected graphs. In particular, lower and upper bounds for linear guessing number are established. Finally, linear guessing numbers of product graphs are investigated. (C) 2014 Elsevier Inc. All rights reserved.

引用

页码：119 / 131

页数：13

共 44 条

[31] Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs
Toshimasa Ishii
Yoko Akiyama
Hiroshi Nagamochi
Algorithmica, 2010, 56 : 413 - 436
[32] Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs
Ishii, Toshimasa
JOURNAL OF DISCRETE ALGORITHMS, 2009, 7 (04) : 570 - 578
[33] Visualizing undirected graphs and symmetric square matrices as overlapping setsMethods and application to character co-occurrences graphs and matrices in novels and DBpedia
Jean-Baptiste Lamy
Multimedia Tools and Applications, 2019, 78 : 33091 - 33112
[34] Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs
Ishii, Toshimasa
Hagiwara, Masayuki
DISCRETE APPLIED MATHEMATICS, 2006, 154 (16) : 2307 - 2329
[35] SRD: A Universal Software Tool for DNA/Protein Sequence Relationship Visualization Based on Undirected Graphs
Zhang, Ning
Gao, Shan
Duan, Guangyou
Feng, Yuanming
Ruan, Jishou
Zhang, Tao
CURRENT BIOINFORMATICS, 2015, 10 (01) : 69 - 78
[36] Consensus Control of Multi-agent Systems Over Undirected Graphs with Quantized Signal Communication
Furusaka, Takumi
Sato, Takao
Araki, Nozomu
Konishi, Yasuo
2018 18TH INTERNATIONAL CONFERENCE ON CONTROL, AUTOMATION AND SYSTEMS (ICCAS), 2018, : 673 - 676
[37] On the Solvability of the Discrete s(x, .)-Laplacian Problems on Simple, Connected, Undirected, Weighted, and Finite Graphs
Pietrusiak, Filip
Wieteska, Renata
Gordinowicz, Przemyslaw
ENTROPY, 2022, 24 (10)
[38] Visualizing undirected graphs and symmetric square matrices as overlapping sets Methods and application to character co-occurrences graphs and matrices in novels and DBpedia
Lamy, Jean-Baptiste
MULTIMEDIA TOOLS AND APPLICATIONS, 2019, 78 (23) : 33091 - 33112
[39] A simplified (O)over-tilde(nm) time edge-splitting algorithm in undirected graphs
Nagamochi, H
Nakamura, S
Ibaraki, T
ALGORITHMICA, 2000, 26 (01) : 50 - 67
[40] Results on graceful chromatic number for particular graphs
Obreja, Camelia
2020 22ND INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC 2020), 2020, : 109 - 116

← 1 2 3 4 5 →