Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/9938
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cvetković, Dragoš | en_US |
dc.contributor.author | Petrić, Milenko | en_US |
dc.date.accessioned | 2020-03-03T14:36:03Z | - |
dc.date.available | 2020-03-03T14:36:03Z | - |
dc.date.issued | 1984-01-01 | - |
dc.identifier.issn | 0012365X | en_US |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/9938 | - |
dc.description.abstract | This paper contains a table of 112 connected graphs on six vertices. The graphs are ordered lexicographically by their spectral moments in non-increasing order. The pictures of graphs are given to show as much symmetry as possible. Several data such as the spectrum, and its main part, coefficients of the characteristic and of the matching polynomial, numbers of circuits, etc., are given for each graph in the table. Several observations implied by this table are noted. © 1984. | en |
dc.relation.ispartof | Discrete Mathematics | en |
dc.title | A table of connected graphs on six vertices | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.doi | 10.1016/0012-365X(84)90033-5 | - |
dc.identifier.scopus | 2-s2.0-0002923688 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/0002923688 | - |
dc.description.version | Unknown | en_US |
dc.relation.lastpage | 49 | en |
dc.relation.firstpage | 37 | en |
dc.relation.issue | C | en |
dc.relation.volume | 50 | en |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
Appears in Collections: | Naučne i umetničke publikacije |
SCOPUSTM
Citations
110
checked on Sep 9, 2023
Page view(s)
48
Last Week
11
11
Last month
0
0
checked on May 3, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.