3 citations · 5 across the 5 of their papers we have counts for
6 papers
Ramsey Properties for -shaped Posets in the Boolean Lattices
Hong-Bin Chen, Wei-Han Chen, Yen-Jen Cheng +2
Given posets , let the {\em Boolean Ramsey number} be the minimum number such…
Domination in the Sierpiński graphs S(K_n,t)
Chia-An Liu
Different types of domination on the Sierpiński graphs S(K_n,t) will be studied in this paper. More precisely, we propose a minimal dominating set for S(K_n,t) so that the exact va…
The Boolean Rainbow Ramsey Number of Antichains, Boolean Posets, and Chains
Hong-Bin Chen, Yen-Jen Cheng, Wei-Tian Li +1
Motivated by the paper of Axenovich and Walzer [2], we study the Ramsey-type problems on the Boolean lattices. Given posets and , we look for the smallest Boolean lattice $\…
On the integer {k}-domination number of circulant graphs
Yen-Jen Cheng, Hung-Lin Fu, Chia-an Liu
Let be a simple undirected graph. is a circulant graph defined on with difference set provided…
On the degree pairs of a graph
Yu-pei Huang, Chia-an Liu, Chih-wen Weng
Let G be a simple graph without isolated vertices. For a vertex i in G, the degree d_i is the number of vertices adjacent to i and the average 2-degree m_i is the mean of the degre…
Spectral Radius and Degree Sequence of a Graph
Chia-an Liu, Chih-wen Weng
Let G be a simple connected graph of order n with degree sequence d_1, d_2, ..., d_n in non-increasing order. The spectral radius rho(G) of G is the largest eigenvalue of its adjac…