The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Elkin Vumar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Elkin Vumar, Heinz Adolf Jung
    Some degree bounds for the circumference of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:299, n:1-3, pp:311-334 [Journal]
  2. Elkin Vumar
    On the Circumference of 3-Connected Quasi-Claw-Free Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2006, v:22, n:2, pp:271-282 [Journal]
  3. Heinz Adolf Jung, Elkin Vumar
    Degree bounds for the circumference of 3-connected graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:50, n:1, pp:55-78 [Journal]
  4. Jiangyan Guo, Elkin Vumar
    The Vertex-Neighbor-Integrity of Digraphs. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (3), 2007, pp:370-376 [Conf]
  5. Aygul Mamut, Elkin Vumar
    A Note on the Integrity of Middle Graphs. [Citation Graph (0, 0)][DBLP]
    CJCDGCGT, 2005, pp:130-134 [Conf]

  6. A note on the connectivity of Kronecker products of graphs. [Citation Graph (, )][DBLP]


  7. Wiener and vertex PI indices of Kronecker products of graphs. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002