메뉴 건너뛰기




Volumn 47, Issue 3, 2011, Pages 403-413

The graph bottleneck identity

Author keywords

Graph bottleneck identity; Graph distances; Matrix forest theorem; Regularized Laplacian kernel; Spanning converging forest; Transitional measure; Vertex vertex proximity

Indexed keywords

GRAPH BOTTLENECK IDENTITY; GRAPH DISTANCES; LAPLACIANS; MATRIX; SPANNING CONVERGING FOREST; TRANSITIONAL MEASURE; VERTEX-VERTEX PROXIMITY;

EID: 79960388606     PISSN: 01968858     EISSN: 10902074     Source Type: Journal    
DOI: 10.1016/j.aam.2010.11.001     Document Type: Article
Times cited : (18)

References (18)
  • 2
    • 78751646102 scopus 로고    scopus 로고
    • A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
    • arXiv:0810.2717 [math.CO], http://arXiv.org/abs/0810.2717
    • P. Chebotarev, A class of graph-geodetic distances generalizing the shortest-path and the resistance distances, Discrete Appl. Math. (2009), doi:10.1016/j.dam.2010.11.017, in press, arXiv:0810.2717 [math.CO], http://arXiv.org/abs/0810.2717.
    • (2009) Discrete Appl. Math.
    • Chebotarev, P.1
  • 3
    • 39049164230 scopus 로고    scopus 로고
    • Spanning forests and the golden ratio
    • DOI 10.1016/j.dam.2007.08.030, PII S0166218X07003794
    • P. Chebotarev Spanning forests and the golden ratio Discrete Appl. Math. 156 2008 813 821 (Pubitemid 351249012)
    • (2008) Discrete Applied Mathematics , vol.156 , Issue.5 , pp. 813-821
    • Chebotarev, P.1
  • 4
    • 84969165400 scopus 로고    scopus 로고
    • Forest matrices around the Laplacian matrix
    • P. Chebotarev, and R. Agaev Forest matrices around the Laplacian matrix Linear Algebra Appl. 356 2002 253 274
    • (2002) Linear Algebra Appl. , vol.356 , pp. 253-274
    • Chebotarev, P.1    Agaev, R.2
  • 5
    • 78650607184 scopus 로고
    • On the proximity measure for graph vertices provided by the inverse Laplacian characteristic matrix
    • 10-12 July, 1995 University of Manchester Manchester, UK
    • P.Yu. Chebotarev, and E. Shamis On the proximity measure for graph vertices provided by the inverse Laplacian characteristic matrix Abstracts of the Conference "Linear Algebra and Its Applications" 10-12 July, 1995 1995 University of Manchester Manchester, UK 6 7 http://www.ma.man.ac.uk/ ~higham/laa95/abstracts.ps
    • (1995) Abstracts of the Conference "linear Algebra and Its Applications" , pp. 6-7
    • Chebotarev, P.Yu.1    Shamis, E.2
  • 6
    • 84902030030 scopus 로고    scopus 로고
    • The matrix-forest theorem and measuring relations in small social groups
    • P.Yu. Chebotarev, and E.V. Shamis The matrix-forest theorem and measuring relations in small social groups Autom. Remote Control 58 1997 1505 1514 (Pubitemid 127374609)
    • (1997) Automation and Remote Control , vol.58 , Issue.9 PART 2 , pp. 1505-1514
    • Chebotarev, P.Yu.1    Shamis, E.V.2
  • 7
    • 84902019281 scopus 로고    scopus 로고
    • On proximity measures for graph vertices
    • P.Yu. Chebotarev, and E.V. Shamis On proximity measures for graph vertices Autom. Remote Control 59 1998 1443 1459 (Pubitemid 128382488)
    • (1998) Automation and Remote Control , vol.59 , Issue.10 PART 2 , pp. 1443-1459
    • Chebotarev, P.Yu.1    Shamis, E.V.2
  • 8
    • 62949244099 scopus 로고    scopus 로고
    • A matrix-based measure of inter-node walk relatedness in a network
    • Mat. Zametki
    • V.M. Chelnokov, and V.L. Zefirova A matrix-based measure of inter-node walk relatedness in a network Math. Notes Mat. Zametki 85 2009 109 119
    • (2009) Math. Notes , vol.85 , pp. 109-119
    • Chelnokov, V.M.1    Zefirova, V.L.2
  • 11
    • 0001834352 scopus 로고
    • Graph theory and crystal physics
    • F. Harary, Academic Press London
    • P.W. Kasteleyn Graph theory and crystal physics F. Harary, Graph Theory and Theoretical Physics 1967 Academic Press London 43 110
    • (1967) Graph Theory and Theoretical Physics , pp. 43-110
    • Kasteleyn, P.W.1
  • 15
    • 0038832457 scopus 로고
    • Self-avoiding paths and the adjacency matrix of a graph
    • J. Ponstein Self-avoiding paths and the adjacency matrix of a graph SIAM J. Appl. Math. 14 1966 600 609
    • (1966) SIAM J. Appl. Math. , vol.14 , pp. 600-609
    • Ponstein, J.1
  • 16


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.