Lidan Pei

Mrs. Lidan Pei


Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 January 2018 in Journal of Inequalities and Applications
Verified
Journal Article
Open access
PDF file
LPLidan Pei
Lidan Pei
XPXiangfeng Pan
Xiangfeng Pan
Let \(G=(V(G),E(G))\) be a graph. A set \(D\subseteq V(G)\) is a distance k-dominating set of G if for every vertex \(u\in V(G)\setminus D\), \(d_{G}(u,v)\leq k\) for some vertex \(v\in D\), where k is a positive integer. The distance k-domination number \(\gamma_{k}(G)\) of G is the minimum cardinality among all distance k-dominating sets of G. The first Zagreb index of G is defined as \(M_{1}=\sum_{u\in V(G)}d^{2}(u)\) and the second Zagreb index of G is \(M_{2}=\sum_{uv\in E(G)}d(u)d(v)\). In this paper, we obtain the upper bounds for the Zagreb indices of n-vertex trees with given distance k-domination number and characterize the extremal trees, which generalize the results of Borovićanin and Furtula (Appl. Math. Comput. 276:208–218, 2016). What is worth mentioning, for an n-vertex tree T, is that a sharp upper bound on the distance k-domination number \(\gamma _{k}(T)\) is determined.

1 January 2021 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
LPLidan Pei
Lidan Pei
XPXiangfeng Pan
Xiangfeng Pan
KWKun Wang
Kun Wang
JTJing Tian
Jing Tian

1 January 2019 in Filomat
Verified
Journal Article
Open access
PDF file
LPLidan Pei
Lidan Pei
XPXiangfeng Pan
Xiangfeng Pan
JTJing Tian
Jing Tian
GPGui-Qin Peng
Gui-Qin Peng
The eccentricity of a vertex is the maximal distance from it to another vertex and the average eccentricity ecc(G) of a graph G is the mean value of eccentricities of all vertices of G. A set S  V(G) is a dominating set of a graph G if NG(v) ∩ S ≠ 0 for any vertex v  V(G)\S. The domination number (G) of G is the minimum cardinality of all dominating sets of G. In this paper, we correct an AutoGraphiX conjecture regarding the domination number and average eccentricity, and present a proof of the revised conjecture. In addition, we establish an upper bound on γ(T)-ecc(T) for an n-vertex tree T.

1 July 2018 in Information Processing Letters
Verified
Journal Article
Closed access
LPLidan Pei
Lidan Pei
XPXiangfeng Pan
Xiangfeng Pan
FHFu-Tao Hu
Fu-Tao Hu

9 May 2020 in Discrete Dynamics in Nature and Society
Verified
Journal Article
Open access
LPLidan Pei
Lidan Pei
XPXiangfeng Pan
Xiangfeng Pan
The domination number γG of a nonempty graph G is the minimum cardinality among all subsets D⊆VG such that NGD=VG. The bondage number bG of a graph G is the smallest number of edges whose removal from G results in a graph with larger domination number. The exact value of bPn,2 for n=0,3,4mod 5 and the bounds of bPn,2 for n=1,2mod 5 are determined.