On k-dimensional graphs and their bases

被引:7
|
作者
Peter S. Buczkowski
Gary Chartrand
Christopher Poisson
Ping Zhang
机构
[1] Western Michigan University,Department of Mathematics and Statistics
关键词
resolving set; dimension; basis;
D O I
10.1023/A:1025745406160
中图分类号
学科分类号
摘要
引用
收藏
页码:9 / 15
页数:6
相关论文
共 50 条
  • [31] MAXIMAL DEVIATION OF K-DIMENSIONAL DENSITY ESTIMATES
    ROSENBLATT, M
    ANNALS OF PROBABILITY, 1976, 4 (06): : 1009 - 1015
  • [33] PROBABILISTIC ANALYSIS OF K-DIMENSIONAL PACKING ALGORITHMS
    HONG, DW
    LEUNG, JYT
    INFORMATION PROCESSING LETTERS, 1995, 55 (01) : 17 - 24
  • [34] Growth of k-Dimensional Systoles in Congruence Coverings
    Belolipetsky, Mikhail
    Weinberger, Shmuel
    GEOMETRIC AND FUNCTIONAL ANALYSIS, 2024, 34 (04) : 979 - 1005
  • [35] On number of ways to shell the k-dimensional trees
    Chae, Gab-Byung
    Cheong, MinSeok
    Kim, Sang-Mok
    BULLETIN OF THE KOREAN MATHEMATICAL SOCIETY, 2007, 44 (02) : 259 - 263
  • [36] Key Management Using K-Dimensional Trees
    Renuka, A.
    Shet, K. C.
    ADCOM: 2008 16TH INTERNATIONAL CONFERENCE ON ADVANCED COMPUTING AND COMMUNICATIONS, 2008, : 52 - +
  • [37] LOW COMPLEXITY K-DIMENSIONAL CENTERED FORMS
    ROKNE, JG
    COMPUTING, 1986, 37 (03) : 247 - 253
  • [38] K-Dimensional Coding Schemes in Hilbert Spaces
    Maurer, Andreas
    Pontil, Massimiliano
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (11) : 5839 - 5846
  • [39] K-Dimensional Trees for Continuous Traffic Classification
    Carela-Espanol, Valentin
    Barlet-Ros, Pere
    Sole-Simo, Marc
    Dainotti, Alberto
    de Donato, Walter
    Pescape, Antonio
    TRAFFIC MONITORING AND ANALYSIS, PROCEEDINGS, 2010, 6003 : 141 - +
  • [40] Randomized K-dimensional binary search trees
    Duch, A
    Estivill-Castro, V
    Martínez, C
    ALGORITHMS AND COMPUTATIONS, 1998, 1533 : 199 - 208