Erfang Shan

ORCID

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 65

Top Venues

Publications

Erfang Shan, Liying Kang, Yisai Xue
The Turán number of Berge hypergraphs with stable properties. Discret. Math. 347 (1) (2024)
Wenrong Lyu, Erfang Shan, Zeguang Cui
Consistency of the Owen value for TU-games with coalition and graph structures. Ann. Oper. Res. 338 (2) (2024)
Liying Kang, Anna B. Khmelnitskaya, Erfang Shan, Dolf Talman, Guang Zhang
The two-step average tree value for graph and hypergraph games. Ann. Oper. Res. 323 (1) (2023)
Erfang Shan
Marginality and a Characterization of the Owen Graph value. Int. J. Game Theory 52 (2) (2023)
Erfang Shan, Jilei Shi, Wenrong Lyu
The efficient partition surplus Owen graph value. Ann. Oper. Res. 320 (1) (2023)
Tao Liu, Wenrong Lyu, Xun-Feng Hu, Erfang Shan
Corrigendum to "A new axiomatization of the Shapley-solidarity value for games with a coalition structure" [Oper. Res. Lett. 46 (2018) 163-167]. Oper. Res. Lett. 51 (6) (2023)
Erfang Shan, Zhiqiang Yu, Wenrong Lyu
Union-wise egalitarian solutions in cooperative games with a coalition structure. 4OR 21 (3) (2023)
Liying Kang, Zhenyu Ni, Erfang Shan
The Turán number of Berge-matching in hypergraphs. Discret. Math. 345 (8) (2022)
Jilei Shi, Lei Cai, Erfang Shan, Wenrong Lyu
A value for cooperative games with coalition and probabilistic graph structures. J. Comb. Optim. 43 (3) (2022)
Yisai Xue, Erfang Shan, Liying Kang
-uniform hypergraphs. Discret. Math. 345 (4) (2022)
Daniel Li Li, Erfang Shan
Safety of links with respect to the Myerson value for communication situations. Oper. Res. 22 (3) (2022)
Erfang Shan, Wenrong Lyu, Jilei Shi, Shanshan Nie
Consistency and the graph Banzhaf value for communication graph games. Oper. Res. Lett. 50 (2) (2022)
Liying Kang, Anna B. Khmelnitskaya, Erfang Shan, Dolf Talman, Guang Zhang
The average tree value for hypergraph games. Math. Methods Oper. Res. 94 (3) (2021)
Daniel Li Li, Erfang Shan
Egalitarian allocation and players of certain type. Oper. Res. Lett. 49 (4) (2021)
Min Zhao, Erfang Shan, Liying Kang
On a Conjecture for Power Domination. Graphs Comb. 37 (4) (2021)
Liying Kang, Hui Zhu, Erfang Shan
Extremal graphs for blow-ups of stars and paths. Discret. Appl. Math. 290 (2021)
Daniel Li Li, Erfang Shan
Cooperative games with partial information. Int. J. Game Theory 50 (1) (2021)
Liying Kang, Zhenyu Ni, Erfang Shan
Decomposing uniform hypergraphs into uniform hypertrees and single edges. Discret. Math. 344 (8) (2021)
Jing Wang, Liying Kang, Erfang Shan
The principal eigenvector to α-spectral radius of hypergraphs. J. Comb. Optim. 42 (2) (2021)
Jilei Shi, Erfang Shan
The Banzhaf value for generalized probabilistic communication situations. Ann. Oper. Res. 301 (1) (2021)
Liying Kang, Wei Zhang, Erfang Shan
The spectral radius and domination number in linear uniform hypergraphs. J. Comb. Optim. 42 (3) (2021)
Erfang Shan, Jilei Shi, Wenrong Lv
A Note on the Position Value for Hypergraph Communication Situations. Complexity and Approximation (2020)
Zuosong Liang, Jianliang Wu, Erfang Shan
List-coloring clique-hypergraphs of K5-minor-free graphs strongly. Discret. Math. 343 (4) (2020)
Daniel Li Li, Erfang Shan
The Myerson value for directed graph games. Oper. Res. Lett. 48 (2) (2020)
Liying Kang, Erfang Shan, Min Zhao
Power domination in the generalized Petersen graphs. Discuss. Math. Graph Theory 40 (3) (2020)
Hui Zhu, Liying Kang, Zhenyu Ni, Erfang Shan
in 3-Uniform Hypergraphs. SIAM J. Discret. Math. 34 (3) (2020)
Daniel Li Li, Erfang Shan
Efficient quotient extensions of the Myerson value. Ann. Oper. Res. 292 (1) (2020)
Daniel Li Li, Erfang Shan
Marginal contributions and derivatives for set functions in cooperative games. J. Comb. Optim. 39 (3) (2020)
Zhenyu Ni, Liying Kang, Erfang Shan, Hui Zhu
Extremal Graphs for Blow-Ups of Keyrings. Graphs Comb. 36 (6) (2020)
Hui Zhu, Liying Kang, Erfang Shan
Extremal Graphs for Odd-Ballooning of Paths and Cycles. Graphs Comb. 36 (3) (2020)
Zuosong Liang, Erfang Shan, Huiyu Xing, Chunsong Bai
A linear-time algorithm for clique-coloring planar graphs. Oper. Res. Lett. 47 (4) (2019)
Qiannan Wang, Liying Kang, Erfang Shan, Zuosong Liang
The α-spectral radius of uniform hypergraphs concerning degrees and domination number. J. Comb. Optim. 38 (4) (2019)
Erfang Shan, Jing Zhao, Liying Kang
Maximally connected p-partite uniform hypergraphs. Discret. Appl. Math. 264 (2019)
Daniel Li Li, Erfang Shan
The position value and the structures of graphs. Appl. Math. Comput. 356 (2019)
Zhangqing Yu, Liying Kang, Lele Liu, Erfang Shan
-index of outerplanar and planar graphs. Appl. Math. Comput. 343 (2019)
Zuosong Liang, Erfang Shan, Liying Kang
The clique-perfectness and clique-coloring of outer-planar graphs. J. Comb. Optim. 38 (3) (2019)
Erfang Shan, Jiayu Han, Jilei Shi
The efficient proportional Myerson values. Oper. Res. Lett. 47 (6) (2019)
Liying Kang, Lele Liu, Erfang Shan
The eigenvectors to the p-spectral radius of general hypergraphs. J. Comb. Optim. 38 (2) (2019)
Erfang Shan, Yanxia Dong, Liying Kang, Shan Li
Extremal hypergraphs for matching number and domination number. Discret. Appl. Math. 236 (2018)
Erfang Shan, Guang Zhang, Xiaokang Shan
The degree value for games with communication structure. Int. J. Game Theory 47 (3) (2018)
Lele Liu, Liying Kang, Erfang Shan
On the irregularity of uniform hypergraphs. Eur. J. Comb. 71 (2018)
Liying Kang, Erfang Shan
Trees with unique least central subtrees. Discuss. Math. Graph Theory 38 (3) (2018)
Yanxia Dong, Erfang Shan, Liying Kang, Shan Li
Domination in intersecting hypergraphs. Discret. Appl. Math. 251 (2018)
Liying Kang, Jianjie Zhou, Erfang Shan
Algorithms for connected p-centdian problem on block graphs. J. Comb. Optim. 36 (1) (2018)
Shan Li, Liying Kang, Erfang Shan, Yanxia Dong
The Finite Projective Plane and the 5-Uniform Linear Intersecting Hypergraphs with Domination Number Four. Graphs Comb. 34 (5) (2018)
Erfang Shan, Liying Kang
The w-centroids and least w-central subtrees in weighted trees. J. Comb. Optim. 36 (4) (2018)
Liying Kang, Lele Liu, Erfang Shan
Sharp Lower Bounds on the Spectral Radius of Uniform Hypergraphs Concerning Degrees. Electron. J. Comb. 25 (2) (2018)
Chunsong Bai, Liying Kang, Erfang Shan
-center problem on cactus graphs. Theor. Comput. Sci. 749 (2018)
Li Su, Liying Kang, Honghai Li, Erfang Shan
The Matching Polynomials and Spectral Radii of Uniform Supertrees. Electron. J. Comb. 25 (4) (2018)
Liying Kang, Wei Zhang, Erfang Shan
The Spectral Radius and Domination Number of Uniform Hypergraphs. COCOA (2) (2017)
Liying Kang, Shan Li, Yanxia Dong, Erfang Shan
Matching and domination numbers in r-uniform hypergraphs. J. Comb. Optim. 34 (2) (2017)
Zuosong Liang, Erfang Shan, Yuzhong Zhang
A linear-time algorithm for clique-coloring problem in circular-arc graphs. J. Comb. Optim. 33 (1) (2017)
Zuosong Liang, Erfang Shan, Liying Kang
}-free planar graphs. Inf. Process. Lett. 118 (2017)
Guang Zhang, Erfang Shan, Liying Kang, Yanxia Dong
Two efficient values of cooperative games with graph structure based on τ-values. J. Comb. Optim. 34 (2) (2017)
Liying Kang, Yi Lin, Erfang Shan
Asymptotic sharpness of bounds on hypertrees. Discuss. Math. Graph Theory 37 (3) (2017)
Daniel Li Li, Erfang Shan
Cost sharing on prices for games on graphs. J. Comb. Optim. 34 (3) (2017)
Erfang Shan, Guang Zhang, Yanxia Dong
Component-wise proportional solutions for communication graph games. Math. Soc. Sci. 81 (2016)
Zuosong Liang, Erfang Shan, Liying Kang
Clique-Coloring Claw-Free Graphs. Graphs Comb. 32 (4) (2016)
Yancai Zhao, Erfang Shan
An efficient algorithm for distance total domination in block graphs. J. Comb. Optim. 31 (1) (2016)
Chunsong Bai, Liying Kang, Erfang Shan
The Connected p-Center Problem on Cactus Graphs. COCOA (2016)
Xinguo Cao, Erfang Shan
Paired-domination in claw-free graphs with minimum degree at least four. Ars Comb. 127 (2016)
Qi Wei, Liying Kang, Erfang Shan
Batching Scheduling in a Two-Level Supply Chain with Earliness and Tardiness Penalties. J. Syst. Sci. Complex. 29 (2) (2016)
Zuosong Liang, Erfang Shan, Liying Kang
Clique-Perfectness of Claw-Free Planar Graphs. Graphs Comb. 32 (6) (2016)
Haichao Wang, Erfang Shan, Yancai Zhao
3-Factor-Criticality in Double Domination Edge Critical Graphs. Graphs Comb. 32 (4) (2016)
Erfang Shan, Liying Kang
w-Centroids and Least (w, l)-Central Subtrees in Weighted Trees. COCOA (2016)
Erfang Shan, Liying Kang
. Theor. Comput. Sci. 592 (2015)
Erfang Shan, Yancai Zhao
Signed mixed dominating functions in complete bipartite graphs. Int. J. Comput. Math. 92 (4) (2015)
Zuosong Liang, Erfang Shan
The clique-transversal set problem in claw-free graphs with degree at most 4. Inf. Process. Lett. 115 (2) (2015)
Liying Kang, Jianjie Zhou, Erfang Shan
The Connected p-Centdian Problem on Block Graphs. COCOA (2015)
Yanxia Dong, Erfang Shan, Liying Kang
Constructing the minimum dominating sets of generalized de Bruijn digraphs. Discret. Math. 338 (8) (2015)
Jianjie Zhou, Liying Kang, Erfang Shan
Two paths location of a tree with positive or negative weights. Theor. Comput. Sci. 607 (2015)
Ligang Zhou, Erfang Shan, Yancai Zhao
Upper signed k-domination number in graphs. Ars Comb. 122 (2015)
Liying Kang, Chunsong Bai, Erfang Shan, Kien Nguyen
The 2-maxian problem on cactus graphs. Discret. Optim. 13 (2014)
Erfang Shan, Zuosong Liang, Liying Kang
Clique-transversal sets and clique-coloring in planar graphs. Eur. J. Comb. 36 (2014)
Liying Kang, Dingguo Wang, Erfang Shan
}-free 4-regular graphs. Discret. Math. 332 (2014)
Erfang Shan, Dingguo Wang
On the numbers of cut-vertices and end-blocks in 4-regular graphs. Discuss. Math. Graph Theory 34 (1) (2014)
Jianjie Zhou, Liying Kang, Erfang Shan
Two Paths Location of a Tree with Positive or Negative Weights. COCOA (2014)
Qi Wei, Erfang Shan, Liying Kang
A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs. Theor. Comput. Sci. 524 (2014)
Shenwei Huang, Liying Kang, Erfang Shan
Paired-Domination in Claw-Free Graphs. Graphs Comb. 29 (6) (2013)
Yancai Zhao, Erfang Shan, Hossein Abdollahzadeh Ahangar
Signed total domination on Kronecker products of two complete graphs. Australas. J Comb. 56 (2013)
Haichao Wang, Erfang Shan
Signed total k-domination in graphs. Ars Comb. 111 (2013)
Shenwei Huang, Erfang Shan, Liying Kang
Perfect matchings in paired domination vertex critical graphs. J. Comb. Optim. 23 (4) (2012)
Dingguo Wang, Erfang Shan
The signed maximum-clique transversal number of regular graphs. Int. J. Comput. Math. 89 (6) (2012)
Erfang Shan, Yanxia Dong
The k-tuple twin domination in generalized de Bruijn and Kautz networks. Comput. Math. Appl. 63 (1) (2012)
Hechao Wang, Erfang Shan, Wei Wang
On the super connectivity of Kronecker products of graphs. Inf. Process. Lett. 112 (10) (2012)
Zuosong Liang, Erfang Shan
Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs. Inf. Process. Lett. 111 (23-24) (2011)
Erfang Shan, Haichao Wang
Claw-free cubic graphs with clique-transversal number half of their order. Appl. Math. Lett. 24 (7) (2011)
Shenwei Huang, Erfang Shan
A note on the upper bound for the paired-domination number of a graph with minimum degree at least two. Networks 57 (2) (2011)
Mingjing Gao, Erfang Shan
The Signed Total Domination Number of Graphs. Ars Comb. 98 (2011)
Haichao Wang, Erfang Shan
-critical graphs. Comput. Math. Appl. 59 (2) (2010)
Lingye Wu, Erfang Shan, Zengrong Liu
On the k-tuple domination of generalized de Brujin and Kautz digraphs. Inf. Sci. 180 (22) (2010)
Erfang Shan, Yancai Zhao
On characterization of uniquely 3-list colorable complete multipartite graphs. Discuss. Math. Graph Theory 30 (1) (2010)
Haichao Wang, Liying Kang, Erfang Shan
Signed clique-transversal functions in graphs. Int. J. Comput. Math. 87 (11) (2010)
Mingjing Gao, Erfang Shan
An upper bound on the restrained domination number of graphs. Ars Comb. 91 (2009)
Erfang Shan, Yanxia Dong, Yukun Cheng
The twin domination number in generalized de Bruijn digraphs. Inf. Process. Lett. 109 (15) (2009)
T. C. Edwin Cheng, Liying Kang, Erfang Shan
A polynomial-time algorithm for the paired-domination problem on permutation graphs. Discret. Appl. Math. 157 (2) (2009)
Hongxing Jiang, Liying Kang, Erfang Shan
Total Restrained Domination in Cubic Graphs. Graphs Comb. 25 (3) (2009)
Erfang Shan, T. C. Edwin Cheng
Upper bounds on the upper signed total domination number of graphs. Discret. Appl. Math. 157 (5) (2009)
Haichao Wang, Erfang Shan
Upper minus total domination of a 5-regular graph. Ars Comb. 91 (2009)
Haichao Wang, Liying Kang, Erfang Shan
Matching Properties in Total Domination Vertex Critical Graphs. Graphs Comb. 25 (6) (2009)

Erfang Shan.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Erfang Shan