Lower bounds on dominating functions in graphs. - Liying Kang; Erfang Shan (Ars Comb., 2000)

Upper bounds for the k-subdomination number of graphs. - Liying Kang; Chuangyin Dang; Mao-cheng Cai; Erfang Shan (Discret. Math., 2002)

Upper bounds on signed 2-independence number of graphs. - Erfang Shan; Moo Young Sohn; Liying Kang (Ars Comb., 2003)

Lower bounds on the minus domination and k-subdomination numbers. - Liying Kang; Hong Qiao; Erfang Shan; Ding-Zhu Du (Theor. Comput. Sci., 2003)

A characterization of trees with equal total domination and paired-domination numbers. - Erfang Shan; Liying Kang; Michael A. Henning (Australas. J Comb., 2004)

A note on Nordhaus-Gaddum inequalities for domination. - Erfang Shan; Chuangyin Dang; Liying Kang (Discret. Appl. Math., 2004)

A note on balance vertices in trees. - Erfang Shan; Liying Kang (Discret. Math., 2004)

A note on domination and minus domination numbers in cubic graphs. - Yaojun Chen; T. C. Edwin Cheng; C. T. Ng 001; Erfang Shan (Appl. Math. Lett., 2005)

Total minus domination in k-partite graphs. - Liying Kang; Erfang Shan; Louis Caccetta (Discret. Math., 2006)

Acyclic domination on bipartite permutation graphs. - Guangjun Xu; Liying Kang; Erfang Shan (Inf. Process. Lett., 2006)

Power domination in block graphs. - Guangjun Xu; Liying Kang; Erfang Shan; Min Zhao (Theor. Comput. Sci., 2006)

Clique-Transversal Sets in Cubic Graphs. - Zuosong Liang; Erfang Shan; T. C. Edwin Cheng (ESCAPE, 2007)

The algorithmic complexity of the minus clique-transversal problem. - Guangjun Xu; Erfang Shan; Liying Kang; T. C. Edwin Cheng (Appl. Math. Comput., 2007)

Bondage number in oriented graphs. - Erfang Shan; Liying Kang (Ars Comb., 2007)

Upper minus total domination in small-degree regular graphs. - Hong Yan 002; Xiaoqi Yang 001; Erfang Shan (Discret. Math., 2007)

Absorbant of generalized de Bruijn digraphs. - Erfang Shan; T. C. Edwin Cheng; Liying Kang (Inf. Process. Lett., 2007)

Erratum to: "A linear vizing-like relation relating the size and total domination number of a graph". - Erfang Shan; Liying Kang; Michael A. Henning (J. Graph Theory, 2007)

Proof of a conjecture on k-tuple domination in graphs. - Guangjun Xu; Liying Kang; Erfang Shan; Hong Yan 002 (Appl. Math. Lett., 2008)

An application of the Turán theorem to domination in graphs. - Erfang Shan; T. C. Edwin Cheng; Liying Kang (Discret. Appl. Math., 2008)

On matching and total domination in graphs. - Michael A. Henning; Liying Kang; Erfang Shan; Anders Yeo (Discret. Math., 2008)

Remarks on the minus (signed) total domination in graphs. - Erfang Shan; T. C. Edwin Cheng (Discret. Math., 2008)

Clique-transversal Number in Cubic Graphs. - Erfang Shan; Zuosong Liang; T. C. Edwin Cheng (Discret. Math. Theor. Comput. Sci., 2008)

An upper bound on the restrained domination number of graphs. - Mingjing Gao; Erfang Shan (Ars Comb., 2009)

Upper minus total domination of a 5-regular graph. - Haichao Wang 004; Erfang Shan (Ars Comb., 2009)

Minus Edge Domination in Graphs. - Min Zhao; Erfang Shan (Ars Comb., 2009)

A polynomial-time algorithm for the paired-domination problem on permutation graphs. - T. C. Edwin Cheng; Liying Kang; Erfang Shan (Discret. Appl. Math., 2009)

Upper bounds on the upper signed total domination number of graphs. - Erfang Shan; T. C. Edwin Cheng (Discret. Appl. Math., 2009)

Total Restrained Domination in Cubic Graphs. - Hongxing Jiang; Liying Kang; Erfang Shan (Graphs Comb., 2009)

Matching Properties in Total Domination Vertex Critical Graphs. - Haichao Wang 004; Liying Kang; Erfang Shan (Graphs Comb., 2009)

The twin domination number in generalized de Bruijn digraphs. - Erfang Shan; Yanxia Dong; Yukun Cheng (Inf. Process. Lett., 2009)

Some matching properties in 4-gamma×2-critical graphs. - Haichao Wang 004; Erfang Shan (Comput. Math. Appl., 2010)

On characterization of uniquely 3-list colorable complete multipartite graphs. - Erfang Shan; Yancai Zhao (Discuss. Math. Graph Theory, 2010)

Signed clique-transversal functions in graphs. - Haichao Wang 004; Liying Kang; Erfang Shan (Int. J. Comput. Math., 2010)

On the k-tuple domination of generalized de Brujin and Kautz digraphs. - Lingye Wu; Erfang Shan; Zengrong Liu (Inf. Sci., 2010)

Claw-free cubic graphs with clique-transversal number half of their order. - Erfang Shan; Haichao Wang 004 (Appl. Math. Lett., 2011)

The Signed Total Domination Number of Graphs. - Mingjing Gao; Erfang Shan (Ars Comb., 2011)

Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs. - Zuosong Liang; Erfang Shan (Inf. Process. Lett., 2011)

A note on the upper bound for the paired-domination number of a graph with minimum degree at least two. - Shenwei Huang; Erfang Shan (Networks, 2011)

The k-tuple twin domination in generalized de Bruijn and Kautz networks. - Erfang Shan; Yanxia Dong (Comput. Math. Appl., 2012)

The signed maximum-clique transversal number of regular graphs. - Dingguo Wang; Erfang Shan (Int. J. Comput. Math., 2012)

On the super connectivity of Kronecker products of graphs. - Hechao Wang; Erfang Shan; Wei Wang 052 (Inf. Process. Lett., 2012)

Perfect matchings in paired domination vertex critical graphs. - Shenwei Huang; Erfang Shan; Liying Kang (J. Comb. Optim., 2012)

Signed total domination on Kronecker products of two complete graphs. - Yancai Zhao; Erfang Shan; Hossein Abdollahzadeh Ahangar (Australas. J Comb., 2013)

Signed total k-domination in graphs. - Haichao Wang 004; Erfang Shan (Ars Comb., 2013)

Paired-Domination in Claw-Free Graphs. - Shenwei Huang; Liying Kang; Erfang Shan (Graphs Comb., 2013)

The 2-maxian problem on cactus graphs. - Liying Kang; Chunsong Bai; Erfang Shan; Kien Nguyen (Discret. Optim., 2014)

Independent sets in {claw, K4}-free 4-regular graphs. - Liying Kang; Dingguo Wang; Erfang Shan (Discret. Math., 2014)

On the numbers of cut-vertices and end-blocks in 4-regular graphs. - Erfang Shan; Dingguo Wang (Discuss. Math. Graph Theory, 2014)

Clique-transversal sets and clique-coloring in planar graphs. - Erfang Shan; Zuosong Liang; Liying Kang (Eur. J. Comb., 2014)

A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs. - Qi Wei 007; Erfang Shan; Liying Kang (Theor. Comput. Sci., 2014)

The Connected p-Centdian Problem on Block Graphs. - Liying Kang; Jianjie Zhou; Erfang Shan (COCOA, 2015)

Upper signed k-domination number in graphs. - Ligang Zhou; Erfang Shan; Yancai Zhao (Ars Comb., 2015)

Constructing the minimum dominating sets of generalized de Bruijn digraphs. - Yanxia Dong; Erfang Shan; Liying Kang (Discret. Math., 2015)

Signed mixed dominating functions in complete bipartite graphs. - Erfang Shan; Yancai Zhao (Int. J. Comput. Math., 2015)

The clique-transversal set problem in claw-free graphs with degree at most 4. - Zuosong Liang; Erfang Shan (Inf. Process. Lett., 2015)

Coloring clique-hypergraphs of graphs with no subdivision of K5. - Erfang Shan; Liying Kang (Theor. Comput. Sci., 2015)

Two paths location of a tree with positive or negative weights. - Jianjie Zhou; Liying Kang; Erfang Shan (Theor. Comput. Sci., 2015)

The Connected p-Center Problem on Cactus Graphs. - Chunsong Bai; Liying Kang; Erfang Shan (COCOA, 2016)

w-Centroids and Least (w, l)-Central Subtrees in Weighted Trees. - Erfang Shan; Liying Kang (COCOA, 2016)

Paired-domination in claw-free graphs with minimum degree at least four. - Xinguo Cao; Erfang Shan (Ars Comb., 2016)

Clique-Coloring Claw-Free Graphs. - Zuosong Liang; Erfang Shan; Liying Kang (Graphs Comb., 2016)

Clique-Perfectness of Claw-Free Planar Graphs. - Zuosong Liang; Erfang Shan; Liying Kang (Graphs Comb., 2016)

3-Factor-Criticality in Double Domination Edge Critical Graphs. - Haichao Wang 004; Erfang Shan; Yancai Zhao (Graphs Comb., 2016)

An efficient algorithm for distance total domination in block graphs. - Yancai Zhao; Erfang Shan (J. Comb. Optim., 2016)

Batching Scheduling in a Two-Level Supply Chain with Earliness and Tardiness Penalties. - Qi Wei 007; Liying Kang; Erfang Shan (J. Syst. Sci. Complex., 2016)

Component-wise proportional solutions for communication graph games. - Erfang Shan; Guang Zhang; Yanxia Dong (Math. Soc. Sci., 2016)

The Spectral Radius and Domination Number of Uniform Hypergraphs. - Liying Kang; Wei Zhang 172; Erfang Shan (COCOA (2), 2017)

Asymptotic sharpness of bounds on hypertrees. - Liying Kang; Yi Lin; Erfang Shan (Discuss. Math. Graph Theory, 2017)

The clique-transversal set problem in {claw, K4}-free planar graphs. - Zuosong Liang; Erfang Shan; Liying Kang (Inf. Process. Lett., 2017)

Matching and domination numbers in r-uniform hypergraphs. - Liying Kang; Shan Li; Yanxia Dong; Erfang Shan (J. Comb. Optim., 2017)

Cost sharing on prices for games on graphs. - Daniel Li Li 001; Erfang Shan (J. Comb. Optim., 2017)

A linear-time algorithm for clique-coloring problem in circular-arc graphs. - Zuosong Liang; Erfang Shan; Yuzhong Zhang (J. Comb. Optim., 2017)

Two efficient values of cooperative games with graph structure based on τ-values. - Guang Zhang; Erfang Shan; Liying Kang; Yanxia Dong (J. Comb. Optim., 2017)

Sharp Lower Bounds on the Spectral Radius of Uniform Hypergraphs Concerning Degrees. - Liying Kang; Lele Liu; Erfang Shan (Electron. J. Comb., 2018)

The Matching Polynomials and Spectral Radii of Uniform Supertrees. - Li Su; Liying Kang; Honghai Li; Erfang Shan (Electron. J. Comb., 2018)

Domination in intersecting hypergraphs. - Yanxia Dong; Erfang Shan; Liying Kang; Shan Li (Discret. Appl. Math., 2018)

Extremal hypergraphs for matching number and domination number. - Erfang Shan; Yanxia Dong; Liying Kang; Shan Li (Discret. Appl. Math., 2018)

Trees with unique least central subtrees. - Liying Kang; Erfang Shan (Discuss. Math. Graph Theory, 2018)

On the irregularity of uniform hypergraphs. - Lele Liu; Liying Kang; Erfang Shan (Eur. J. Comb., 2018)

The Finite Projective Plane and the 5-Uniform Linear Intersecting Hypergraphs with Domination Number Four. - Shan Li; Liying Kang; Erfang Shan; Yanxia Dong (Graphs Comb., 2018)

The degree value for games with communication structure. - Erfang Shan; Guang Zhang; Xiaokang Shan (Int. J. Game Theory, 2018)

Algorithms for connected p-centdian problem on block graphs. - Liying Kang; Jianjie Zhou; Erfang Shan (J. Comb. Optim., 2018)

The w-centroids and least w-central subtrees in weighted trees. - Erfang Shan; Liying Kang (J. Comb. Optim., 2018)

The connected p-center problem on cactus graphs. - Chunsong Bai; Liying Kang; Erfang Shan (Theor. Comput. Sci., 2018)

The position value and the structures of graphs. - Daniel Li Li 001; Erfang Shan (Appl. Math. Comput., 2019)

The extremal α-index of outerplanar and planar graphs. - Zhangqing Yu; Liying Kang; Lele Liu; Erfang Shan (Appl. Math. Comput., 2019)

Maximally connected p-partite uniform hypergraphs. - Erfang Shan; Jing Zhao; Liying Kang (Discret. Appl. Math., 2019)

The eigenvectors to the p-spectral radius of general hypergraphs. - Liying Kang; Lele Liu; Erfang Shan (J. Comb. Optim., 2019)

The clique-perfectness and clique-coloring of outer-planar graphs. - Zuosong Liang; Erfang Shan; Liying Kang (J. Comb. Optim., 2019)

The α-spectral radius of uniform hypergraphs concerning degrees and domination number. - Qiannan Wang; Liying Kang; Erfang Shan; Zuosong Liang (J. Comb. Optim., 2019)

A linear-time algorithm for clique-coloring planar graphs. - Zuosong Liang; Erfang Shan; Huiyu Xing; Chunsong Bai (Oper. Res. Lett., 2019)

The efficient proportional Myerson values. - Erfang Shan; Jiayu Han; Jilei Shi (Oper. Res. Lett., 2019)

A Note on the Position Value for Hypergraph Communication Situations. - Erfang Shan; Jilei Shi; Wenrong Lv (Complexity and Approximation, 2020)

Efficient quotient extensions of the Myerson value. - Daniel Li Li 001; Erfang Shan (Ann. Oper. Res., 2020)

List-coloring clique-hypergraphs of K5-minor-free graphs strongly. - Zuosong Liang; Jianliang Wu 001; Erfang Shan (Discret. Math., 2020)

Power domination in the generalized Petersen graphs. - Liying Kang; Erfang Shan; Min Zhao (Discuss. Math. Graph Theory, 2020)

Extremal Graphs for Blow-Ups of Keyrings. - Zhenyu Ni; Liying Kang; Erfang Shan; Hui Zhu 008 (Graphs Comb., 2020)

Extremal Graphs for Odd-Ballooning of Paths and Cycles. - Hui Zhu 008; Liying Kang; Erfang Shan (Graphs Comb., 2020)

Marginal contributions and derivatives for set functions in cooperative games. - Daniel Li Li 001; Erfang Shan (J. Comb. Optim., 2020)

The Myerson value for directed graph games. - Daniel Li Li 001; Erfang Shan (Oper. Res. Lett., 2020)

The Turán Number of Berge-K4 in 3-Uniform Hypergraphs. - Hui Zhu 008; Liying Kang; Zhenyu Ni; Erfang Shan (SIAM J. Discret. Math., 2020)

The Banzhaf value for generalized probabilistic communication situations. - Jilei Shi; Erfang Shan (Ann. Oper. Res., 2021)

Extremal graphs for blow-ups of stars and paths. - Liying Kang; Hui Zhu 008; Erfang Shan (Discret. Appl. Math., 2021)

Decomposing uniform hypergraphs into uniform hypertrees and single edges. - Liying Kang; Zhenyu Ni; Erfang Shan (Discret. Math., 2021)

On a Conjecture for Power Domination. - Min Zhao; Erfang Shan; Liying Kang (Graphs Comb., 2021)

Cooperative games with partial information. - Daniel Li Li 001; Erfang Shan (Int. J. Game Theory, 2021)

The spectral radius and domination number in linear uniform hypergraphs. - Liying Kang; Wei Zhang 172; Erfang Shan (J. Comb. Optim., 2021)

The principal eigenvector to α-spectral radius of hypergraphs. - Jing Wang; Liying Kang; Erfang Shan (J. Comb. Optim., 2021)

The average tree value for hypergraph games. - Liying Kang; Anna B. Khmelnitskaya; Erfang Shan; Dolf Talman; Guang Zhang (Math. Methods Oper. Res., 2021)

Egalitarian allocation and players of certain type. - Daniel Li Li 001; Erfang Shan (Oper. Res. Lett., 2021)

The Turán number of Berge-matching in hypergraphs. - Liying Kang; Zhenyu Ni; Erfang Shan (Discret. Math., 2022)

Anti-Ramsey number of matchings in r-partite r-uniform hypergraphs. - Yisai Xue; Erfang Shan; Liying Kang (Discret. Math., 2022)

A value for cooperative games with coalition and probabilistic graph structures. - Jilei Shi; Lei Cai; Erfang Shan; Wenrong Lyu (J. Comb. Optim., 2022)

Safety of links with respect to the Myerson value for communication situations. - Daniel Li Li 001; Erfang Shan (Oper. Res., 2022)

Consistency and the graph Banzhaf value for communication graph games. - Erfang Shan; Wenrong Lyu; Jilei Shi; Shanshan Nie (Oper. Res. Lett., 2022)

The efficient partition surplus Owen graph value. - Erfang Shan; Jilei Shi; Wenrong Lyu (Ann. Oper. Res., 2023)

The two-step average tree value for graph and hypergraph games. - Liying Kang; Anna B. Khmelnitskaya; Erfang Shan; Dolf Talman; Guang Zhang (Ann. Oper. Res., 2023)

Marginality and a Characterization of the Owen Graph value. - Erfang Shan (Int. J. Game Theory, 2023)

Union-wise egalitarian solutions in cooperative games with a coalition structure. - Erfang Shan; Zhiqiang Yu; Wenrong Lyu (4OR, 2023)

Corrigendum to "A new axiomatization of the Shapley-solidarity value for games with a coalition structure" [Oper. Res. Lett. 46 (2018) 163-167]. - Tao Liu; Wenrong Lyu; Xun-Feng Hu 001; Erfang Shan (Oper. Res. Lett., 2023)

The Turán number of Berge hypergraphs with stable properties. - Erfang Shan; Liying Kang; Yisai Xue (Discret. Math., 2024)

Consistency of the Owen value for TU-games with coalition and graph structures. - Wenrong Lyu; Erfang Shan; Zeguang Cui (Ann. Oper. Res., 2024)

A new value for communication situations. - Daniel Li Li 001; Erfang Shan (Math. Methods Oper. Res., 2024)

New axiomatizations of the Priority value for cooperative games with priority structure. - Songtao He; Erfang Shan; Yuxin Sun (Oper. Res. Lett., 2025)

Pseudo-Shapley value for weak games of threats. - Daniel Li Li 001; Erfang Shan (J. Comb. Optim., 2025)

Mutually dependent, balanced contributions, and the priority value. - Songtao He; Erfang Shan; Yuxin Sun (J. Comb. Optim., 2025)

Solidarity Value for Graph Games. - Daniel Li 001; Erfang Shan (J. Optim. Theory Appl., 2025)