首页
学术期刊
论文检测
AIGC检测
热点
更多
数据
Spectral upper bounds for the Grundy number of a graph
被引:0
|
作者
:
Assis, Thiago
论文数:
0
引用数:
0
h-index:
0
机构:
Dept. of Computer Science, Universidade Federal de Minas Gerais, Brazil
Dept. of Computer Science, Universidade Federal de Minas Gerais, Brazil
Assis, Thiago
[
1
]
Coutinho, Gabriel
论文数:
0
引用数:
0
h-index:
0
机构:
Dept. of Computer Science, Universidade Federal de Minas Gerais, Brazil
Dept. of Computer Science, Universidade Federal de Minas Gerais, Brazil
Coutinho, Gabriel
[
1
]
Juliano, Emanuel
论文数:
0
引用数:
0
h-index:
0
机构:
Dept. of Computer Science, Universidade Federal de Minas Gerais, Brazil
Dept. of Computer Science, Universidade Federal de Minas Gerais, Brazil
Juliano, Emanuel
[
1
]
机构
:
[1]
Dept. of Computer Science, Universidade Federal de Minas Gerais, Brazil
来源
:
arXiv
|
关键词
:
Computational complexity - Graph theory - Polynomials;
D O I
:
暂无
中图分类号
:
学科分类号
:
摘要
:
引用
收藏
相关论文
共 50 条
[1]
Spectral upper bounds for the Grundy number of a graph
Assis, Thiago
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Fed Minas Gerais, Dept Comp Sci, Belo Horizonte, Brazil
Univ Fed Minas Gerais, Dept Comp Sci, Belo Horizonte, Brazil
Assis, Thiago
Coutinho, Gabriel
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Fed Minas Gerais, Dept Comp Sci, Belo Horizonte, Brazil
Univ Fed Minas Gerais, Dept Comp Sci, Belo Horizonte, Brazil
Coutinho, Gabriel
Juliano, Emanuel
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Fed Minas Gerais, Dept Comp Sci, Belo Horizonte, Brazil
Univ Fed Minas Gerais, Dept Comp Sci, Belo Horizonte, Brazil
Juliano, Emanuel
DISCRETE MATHEMATICS,
2025,
348
(03)
[2]
On the Grundy Number of a Graph
Havet, Frederic
论文数:
0
引用数:
0
h-index:
0
机构:
UNSA, CNRS, I3S, Projet Mascotte, F-06902 Sophia Antipolis, France
UNSA, CNRS, I3S, Projet Mascotte, F-06902 Sophia Antipolis, France
Havet, Frederic
Sampaio, Leonardo
论文数:
0
引用数:
0
h-index:
0
机构:
UNSA, CNRS, I3S, Projet Mascotte, F-06902 Sophia Antipolis, France
UNSA, CNRS, I3S, Projet Mascotte, F-06902 Sophia Antipolis, France
Sampaio, Leonardo
PARAMETERIZED AND EXACT COMPUTATION,
2010,
6478
: 170
-
179
[3]
Upper bounds on the bondage number of a graph
Samodivkin, Vladimir
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Architecture Civil Engn & Geodesy, Dept Math, Sofia, Bulgaria
Univ Architecture Civil Engn & Geodesy, Dept Math, Sofia, Bulgaria
Samodivkin, Vladimir
ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS,
2018,
6
(01)
: 1
-
16
[4]
More bounds for the Grundy number of graphs
Zixing Tang
论文数:
0
引用数:
0
h-index:
0
机构:
Xinjiang University,College of Mathematics and System Sciences
Zixing Tang
Baoyindureng Wu
论文数:
0
引用数:
0
h-index:
0
机构:
Xinjiang University,College of Mathematics and System Sciences
Baoyindureng Wu
Lin Hu
论文数:
0
引用数:
0
h-index:
0
机构:
Xinjiang University,College of Mathematics and System Sciences
Lin Hu
Manoucheher Zaker
论文数:
0
引用数:
0
h-index:
0
机构:
Xinjiang University,College of Mathematics and System Sciences
Manoucheher Zaker
Journal of Combinatorial Optimization,
2017,
33
: 580
-
589
[5]
Upper bounds on the linear chromatic number of a graph
Li, Chao
论文数:
0
引用数:
0
h-index:
0
机构:
Zhejiang Normal Univ, Dept Math, Jinhua 321004, Peoples R China
Zhejiang Normal Univ, Dept Math, Jinhua 321004, Peoples R China
Li, Chao
Wang, Weifan
论文数:
0
引用数:
0
h-index:
0
机构:
Zhejiang Normal Univ, Dept Math, Jinhua 321004, Peoples R China
Zhejiang Normal Univ, Dept Math, Jinhua 321004, Peoples R China
Wang, Weifan
Raspaud, Andre
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Bordeaux 1, LaBRI UMR CNRS 5800, F-33405 Talence, France
Zhejiang Normal Univ, Dept Math, Jinhua 321004, Peoples R China
Raspaud, Andre
DISCRETE MATHEMATICS,
2011,
311
(04)
: 232
-
238
[6]
Algorithmic upper bounds for graph geodetic number
Ahmad T. Anaqreh
论文数:
0
引用数:
0
h-index:
0
机构:
University of Szeged,Institute of Informatics
Ahmad T. Anaqreh
Boglárka G.-Tóth
论文数:
0
引用数:
0
h-index:
0
机构:
University of Szeged,Institute of Informatics
Boglárka G.-Tóth
Tamás Vinkó
论文数:
0
引用数:
0
h-index:
0
机构:
University of Szeged,Institute of Informatics
Tamás Vinkó
Central European Journal of Operations Research,
2022,
30
: 1221
-
1237
[7]
Algorithmic upper bounds for graph geodetic number
Anaqreh, Ahmad T.
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Szeged, Inst Informat, Szeged, Hungary
Univ Szeged, Inst Informat, Szeged, Hungary
Anaqreh, Ahmad T.
G-Toth, Boglarka
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Szeged, Inst Informat, Szeged, Hungary
Univ Szeged, Inst Informat, Szeged, Hungary
G-Toth, Boglarka
Vinko, Tamas
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Szeged, Inst Informat, Szeged, Hungary
Univ Szeged, Inst Informat, Szeged, Hungary
Vinko, Tamas
CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH,
2022,
30
(04)
: 1221
-
1237
[8]
New upper bounds for the chromatic number of a graph
Stacho, L
论文数:
0
引用数:
0
h-index:
0
机构:
Slovak Acad Sci, Inst Math, Dept Informat, Bratislava 84000 4, Slovakia
Slovak Acad Sci, Inst Math, Dept Informat, Bratislava 84000 4, Slovakia
Stacho, L
JOURNAL OF GRAPH THEORY,
2001,
36
(02)
: 117
-
120
[9]
Sharp upper bounds of the spectral radius of a graph
Guo, Ji-Ming
论文数:
0
引用数:
0
h-index:
0
机构:
East China Univ Sci & Technol, Dept Math, Shanghai, Peoples R China
East China Univ Sci & Technol, Dept Math, Shanghai, Peoples R China
Guo, Ji-Ming
Wang, Zhi-Wen
论文数:
0
引用数:
0
h-index:
0
机构:
East China Univ Sci & Technol, Dept Math, Shanghai, Peoples R China
East China Univ Sci & Technol, Dept Math, Shanghai, Peoples R China
Wang, Zhi-Wen
Li, Xin
论文数:
0
引用数:
0
h-index:
0
机构:
East China Univ Sci & Technol, Dept Math, Shanghai, Peoples R China
East China Univ Sci & Technol, Dept Math, Shanghai, Peoples R China
Li, Xin
DISCRETE MATHEMATICS,
2019,
342
(09)
: 2559
-
2563
[10]
Some upper bounds on the spectral radius of a graph
Wang, Zhi-Wen
论文数:
0
引用数:
0
h-index:
0
机构:
East China Univ Sci & Technol, Dept Math, Shanghai, Peoples R China
East China Univ Sci & Technol, Dept Math, Shanghai, Peoples R China
Wang, Zhi-Wen
Guo, Ji-Ming
论文数:
0
引用数:
0
h-index:
0
机构:
East China Univ Sci & Technol, Dept Math, Shanghai, Peoples R China
East China Univ Sci & Technol, Dept Math, Shanghai, Peoples R China
Guo, Ji-Ming
LINEAR ALGEBRA AND ITS APPLICATIONS,
2020,
601
: 101
-
112
←
1
2
3
4
5
→