126 citations
- Hong Kong Polytechnic UniversityHK7 papers
- Lianyungang Oriental HospitalCN6 papers
- Shanghai Jiao Tong UniversityCN6 papers
- Xuzhou Medical CollegeCN6 papers
- East China Normal UniversityCN5 papers
- Fudan UniversityCN4 papers
- Shanghai UniversityCN4 papers
- University of MacauMO4 papers
- China Academy of Engineering PhysicsCN3 papers
- Chinese Academy of SciencesCN3 papers
- Institute of Theoretical PhysicsCN3 papers
- Southwest University of Science and TechnologyCN3 papers
5 papers · 1 filter
Least -eigenvalues of nonbipartite 2-connected graphs
Guanglong Yu, by Lin Sun, Chao Yan +2
Among all simple nonbipartite 2-connected graphs and among all nonbipartite -graphs, the minimum least -eigenvalues are completely determined, respectively.
Further results on the least Q-eigenvalue of a graph with fixed domination number
Guanglong Yu, Yarong Wu, Mingqing Zhai
In this paper, we proceed on determining the minimum among the connected nonbipartite graphs on vertices and with domination number $\frac{n+1}{3}<γ\leq \frac{n…
A Note on the Alon-Kleitman Argument for Sum-free Subset Theorem
Zhengjun Cao, Lihua Liu
In 1990, Alon and Kleitman proposed an argument for the sum-free subset problem: every set of n nonzero elements of a finite Abelian group contains a sum-free subset A of size |A|>…
The domination number and the least -eigenvalue
Guanglong Yu, Shu-Guang Guo, Rong Zhang +1
A vertex set of a graph is said to be a dominating set if every vertex of is adjacent to at least a vertex in , and the domination number (,…
Vertices in all minimum paired-dominating sets of block graphs
Lei Chen, Changhong Lu, Zhenbing Zeng
Let be a simple graph without isolated vertices. A set is a paired-dominating set if every vertex in has at least one neighbor in and the subgrap…