60 citations · 110 across the 10 of their papers we have counts for
10 papers
A duality of scaffolds for translation association schemes
Xiaoye Liang, Ying-Ying Tan, Hajime Tanaka +1
Scaffolds are certain tensors arising in the study of association schemes, and have been (implicitly) understood diagrammatically as digraphs with distinguished "root" nodes and wi…
Remarks on pseudo-vertex-transitive graphs with small diameter
Jack H. Koolen, Jae-Ho Lee, Ying-Ying Tan
Let denote a -polynomial distance-regular graph with vertex set and diameter . Let denote the adjacency matrix of . For a vertex and for $0 \leq i \le…
The normalized Laplacians and random walks of the parallel subdivision graphs
Jing Zhao, Jia-Bao Liu, Ying-Ying Tan +1
The -parallel subdivision graph is generated from which each edge of is replaced by parallel paths of length 2. The -parallel subdivision graph $S_{2k}(…
A spectral characterization of the -clique extension of the triangular graphs
Ying-Ying Tan, Jack H. Koolen, Zheng-Jiang Xia
A regular graph is co-edge regular if there exists a constant such that any two distinct and non-adjacent vertices have exactly common neighbors. In this paper, we show tha…
The largest -eigenvalue and spectral radius of Laplacian tensor of non-odd-bipartite generalized power hypergraphs
Yi-Zheng Fan, Murad-ul-Islam Khan, Ying-Ying Tan
Let be a simple graph or hypergraph, and let be the adjacency, Laplacian and signless Laplacian tensors of respectively. The largest -eigenvalues (resp.…
The -spectrum of a generalized power hypergraph
Murad-ul-Islam Khan, Yi-Zheng Fan
The generalized power of a simple graph , denoted by , is obtained from by blowing up each vertex into an -set and each edge into a -set, where $1 \le s \le \…
Maximizing spectral radii of uniform hypergraphs with few edges
Yi-Zheng Fan, Ying-Ying Tan, Xi-Xi Peng +1
In this paper we investigate the hypergraphs whose spectral radii attain the maximum among all uniform hypergraphs with given number of edges. In particular we characterize the hyp…
Lower bounds for algebraic connectivity of graphs in terms of matching number or edge covering number
Jing Xu, Yi-Zheng Fan, Ying-Ying Tan
In this paper we characterize the unique graph whose algebraic connectivity is minimum among all connected graphs with given order and fixed matching number or edge covering number…
A lower bound for the algebraic connectivity of a graph in terms of the domination number
Yi-Zheng Fan, Ying-Ying Tan
We investigate how the algebraic connectivity of a graph changes by relocating a connected branch from one vertex to another vertex, and then minimize the algebraic connectivity am…
The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number
Yi-Zheng Fan, Ying-Ying Tan
Let be a connected non-bipartite graph on vertices with domination number . We investigate the least eigenvalue of the signless Laplacian of , and pr…