热门出版物 - 学术资源搜索

h5 指数:27
h5 中位数:33

h5 指数是指在过去整整 5 年中所发表文章的 h 指数。h 指在 2017-2021 年间发表的 h 篇文章每篇至少都被引用过 h 次的最大值。隐藏

出版物的 h5 中位数，是指出版物的 h5 指数所涵盖的所有文章获得的引用次数的中位值。隐藏

标题/作者	引用次数	年份
On ve-degrees and ev-degrees in graphs M Chellali, TW Haynes, ST Hedetniemi, TM Lewis Discrete Mathematics 340 (2), 31-38	78	2017
Complete weight enumerators of a class of linear codes S Yang, ZA Yao Discrete Mathematics 340 (4), 729-739	59	2017
On the edge dimension of a graph N Zubrilina Discrete Mathematics 341 (7), 2083-2088	55	2018
An introduction to the discharging method via graph coloring DW Cranston, DB West Discrete Mathematics 340 (4), 766-793	53	2017
On constacyclic codes of length 4ps over Fpm+ uFpm HQ Dinh, S Dhompongsa, S Sriboonchitta Discrete Mathematics 340 (4), 832-849	47	2017
Graphs determined by their Aα-spectra H Lin, X Liu, J Xue Discrete Mathematics 342 (2), 441-450	43	2019
Infinite families of 2-designs and 3-designs from linear codes C Ding, C Li Discrete Mathematics 340 (10), 2415-2431	42	2017
A sufficient condition for DP-4-colorability SJ Kim, K Ozeki Discrete Mathematics 341 (7), 1983-1986	39	2018
LLT polynomials, chromatic quasisymmetric functions and graphs with cycles P Alexandersson, G Panova Discrete Mathematics 341 (12), 3453-3482	38	2018
The Turán number of disjoint copies of paths LT Yuan, XD Zhang Discrete Mathematics 340 (2), 132-139	38	2017
The complexity of signed graph and edge-coloured graph homomorphisms RC Brewster, F Foucaud, P Hell, R Naserasr Discrete Mathematics 340 (2), 223-235	37	2017
Structure and algorithms for (cap, even hole)-free graphs K Cameron, MVG da Silva, S Huang, K Vušković Discrete Mathematics 341 (2), 463-473	35	2018
Binding number conditions for P≥ 2-factor and P≥ 3-factor uniform graphs S Zhou, Z Sun Discrete Mathematics 343 (3), 111715	33	2020
Turán numbers for Berge-hypergraphs and related extremal problems C Palmer, M Tait, C Timmons, AZ Wagner Discrete Mathematics 342 (6), 1553-1563	33	2019
Complete weight enumerators of two classes of linear codes Q Wang, F Li, K Ding, D Lin Discrete Mathematics 340 (3), 467-480	32	2017
Dimensions of three types of BCH codes over GF (q) H Liu, C Ding, C Li Discrete Mathematics 340 (8), 1910-1927	32	2017
On graphs with largest possible game domination number K Xu, X Li, S Klavžar Discrete Mathematics 341 (6), 1768-1777	30	2018
Packing chromatic number of cubic graphs J Balogh, A Kostochka, X Liu Discrete Mathematics 341 (2), 474-483	30	2018
Edge-colorings of graphs avoiding complete graphs with a prescribed coloring FS Benevides, C Hoppen, RM Sampaio Discrete Mathematics 340 (9), 2143-2160	29	2017
A framework for constructing de Bruijn sequences via simple successor rules D Gabric, J Sawada, A Williams, D Wong Discrete Mathematics 341 (11), 2977-2987	29	2018

1 - 20

计算机程序会自动估算并确定日期和引用次数。