In this article we study the problem of finding the k-adjacency dimension of a graph. We give some necessary and sufficient conditions for the existence of a k-adjacency basis of an arbitrary graph G and we obtain general results on the k-adjacency dimension, including general bounds and closed formulae for some families of graphs.
机构:
Academy of Mathematics and Systems Science, Chinese Academy of Sciences
Science and Technology on Communication Security LaboratoryAcademy of Mathematics and Systems Science, Chinese Academy of Sciences
WANG Hui
FENG Xiutao
论文数: 0引用数: 0
h-index: 0
机构:
Academy of Mathematics and Systems Science, Chinese Academy of SciencesAcademy of Mathematics and Systems Science, Chinese Academy of Sciences
机构:
Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China
Sci & Technol Commun Secur Lab, Chengdu 610041, Peoples R ChinaChinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China
Wang, Hui
Feng, Xiutao
论文数: 0引用数: 0
h-index: 0
机构:
Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R ChinaChinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China