메뉴 건너뛰기




Volumn 156, Issue 7, 2008, Pages 986-997

On bags and bugs

Author keywords

Bags; Bugs; Diameter; Extremal graphs; Graph; Index; Radius

Indexed keywords

PROBLEM SOLVING;

EID: 40349098099     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2007.05.044     Document Type: Article
Times cited : (38)

References (14)
  • 2
    • 0035193053 scopus 로고    scopus 로고
    • On the spectral radius of graphs with cut vertices
    • Berman A., and Zhang X.-D. On the spectral radius of graphs with cut vertices. J. Combin. Theory Ser. B 83 (2001) 233-240
    • (2001) J. Combin. Theory Ser. B , vol.83 , pp. 233-240
    • Berman, A.1    Zhang, X.-D.2
  • 4
    • 0006866686 scopus 로고
    • On the spectral radius of complementary acyclic matrices of zero and ones
    • Brualdi R.A., and Solheid E.S. On the spectral radius of complementary acyclic matrices of zero and ones. SIAM J. Algebraic Discrete Methods 7 (1986) 265-272
    • (1986) SIAM J. Algebraic Discrete Methods , vol.7 , pp. 265-272
    • Brualdi, R.A.1    Solheid, E.S.2
  • 6
    • 0346785310 scopus 로고    scopus 로고
    • Variable neighborhood search for extremal graphs. V. Three ways to automate finding conjectures
    • Caporossi G., and Hansen P. Variable neighborhood search for extremal graphs. V. Three ways to automate finding conjectures. Discrete Math. 276 (2004) 81-94
    • (2004) Discrete Math. , vol.276 , pp. 81-94
    • Caporossi, G.1    Hansen, P.2
  • 8
    • 44649182838 scopus 로고    scopus 로고
    • On some interconnections between combinatorial optimization and extremal graph theory
    • Cvetković D., Hansen P., and Kovačević-Vujčić V. On some interconnections between combinatorial optimization and extremal graph theory. Yugoslav J. Oper. Res. 14 (2004) 147-154
    • (2004) Yugoslav J. Oper. Res. , vol.14 , pp. 147-154
    • Cvetković, D.1    Hansen, P.2    Kovačević-Vujčić, V.3
  • 9
    • 0013151445 scopus 로고    scopus 로고
    • Variable neighborhood search for extremal graphs. III. On the largest eigenvalue of color-constrained trees
    • Cvetković D., Simić S., Caporossi G., and Hansen P. Variable neighborhood search for extremal graphs. III. On the largest eigenvalue of color-constrained trees. Linear and Multilinear Algebra 49 (2001) 143-160
    • (2001) Linear and Multilinear Algebra , vol.49 , pp. 143-160
    • Cvetković, D.1    Simić, S.2    Caporossi, G.3    Hansen, P.4
  • 11
    • 0031281221 scopus 로고    scopus 로고
    • Variable neighborhood search
    • Mladenović N., and Hansen P. Variable neighborhood search. Comput. Oper. Res. 24(11) (1997) 1097-1100
    • (1997) Comput. Oper. Res. , vol.24 11 , pp. 1097-1100
    • Mladenović, N.1    Hansen, P.2
  • 12
    • 40349107933 scopus 로고    scopus 로고
    • A. Schwenk, How to compute characteristic polynomial of a graph? Lecture Notes in Mathematics, vol. 406, 1974, pp. 45-51.
    • A. Schwenk, How to compute characteristic polynomial of a graph? Lecture Notes in Mathematics, vol. 406, 1974, pp. 45-51.
  • 13
    • 33646899114 scopus 로고    scopus 로고
    • Some results on the index of unicyclic graphs
    • Belardo F., Marzi E.M.L., and Simic S.K. Some results on the index of unicyclic graphs. Linear Algebra Appl. 416 (2006) 1048-1059
    • (2006) Linear Algebra Appl. , vol.416 , pp. 1048-1059
    • Belardo, F.1    Marzi, E.M.L.2    Simic, S.K.3
  • 14
    • 40349099622 scopus 로고
    • On the number of edges in a graph with given radius
    • (Russian)
    • Vizing V.G. On the number of edges in a graph with given radius. Dokl. Akad. Nauk. SSSR 173 (1967) 1245-1246 (Russian)
    • (1967) Dokl. Akad. Nauk. SSSR , vol.173 , pp. 1245-1246
    • Vizing, V.G.1


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