| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Computing the Szeged index
Authors:ID Žerovnik, Janez (Author)
Files:.pdf Croatica_Chemica_Acta_1996_Zerovnik_Computing_the_Szeged_index.pdf (1,83 MB)
MD5: 0F701E6104162012EA8886063B01D6C7
PID: 20.500.12556/dkum/2c0143cc-3a0e-45e2-b319-30e9a64e790a
 
URL http://hrcak.srce.hr/177115
 
Language:English
Work type:Scientific work
Typology:1.01 - Original Scientific Article
Organization:FS - Faculty of Mechanical Engineering
Abstract:We give an explicit algorithm for computing the Szeged index of a graph which runs in ▫$O(mn)$▫ time, where ▫$n$▫ is the number of nodes and ▫$m$▫ is the number of edges.
Keywords:mathematics, chemistry, chemical graph theory, molecular graphs, structural formulae, algorithms, topological index, Szeged index
Publication status:Published
Publication version:Version of Record
Year of publishing:1996
Number of pages:str. 837-843
Numbering:Letn. 69, št. 3
PID:20.500.12556/DKUM-66649 New window
ISSN:0011-1643
UDC:519.17:541
ISSN on article:0011-1643
COBISS.SI-ID:2415126 New window
NUK URN:URN:SI:UM:DK:CDPQSMWL
Publication date in DKUM:05.07.2017
Views:2097
Downloads:133
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Croatica Chemica Acta
Shortened title:Croat. Chem. Acta
Publisher:Hrvatsko kemijsko društvo
ISSN:0011-1643
COBISS.SI-ID:22807 New window

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.
Licensing start date:05.07.2017

Secondary language

Language:Slovenian
Title:Računanje szegedskega indeksa
Abstract:Dan je algoritem za računanje szegedskega indeksa grafa s časovno zahtevnostjo ▫$O(m,n)$▫, kjer je ▫$n$▫ število točk, ▫$m$▫ pa število povezav.
Keywords:matematika, kemija, kemijska teorija grafov, molekulski grafi, strukturne formule, topološki indeks, szegedski indeks, algoritmi


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica