About: Szeged index

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In chemical graph theory, the Szeged index is a topological index of a molecule, used in biochemistry. The Szeged index, introduced by Iván Gutman, generalizes the concept of the Wiener index introduced by Harry Wiener. The Szeged index of a connected graph G is defined as If e is an edge of G connecting vertices u and v, then we write e = uv or e = vu. For , let and be respectively the number of vertices of G lying closer to vertex u than to vertex v and the number of vertices of G lying closer to vertex v than to vertex u.

thumbnail
Property Value
dbo:abstract
  • In chemical graph theory, the Szeged index is a topological index of a molecule, used in biochemistry. The Szeged index, introduced by Iván Gutman, generalizes the concept of the Wiener index introduced by Harry Wiener. The Szeged index of a connected graph G is defined as If e is an edge of G connecting vertices u and v, then we write e = uv or e = vu. For , let and be respectively the number of vertices of G lying closer to vertex u than to vertex v and the number of vertices of G lying closer to vertex v than to vertex u. Szeged index plays an important role in information theory. One way to measure a network structure is through the so-called topological indices. Szeged index has been shown to correlate well with numerous biological and physicochemical properties. (en)
dbo:thumbnail
dbo:wikiPageID
  • 56077815 (xsd:integer)
dbo:wikiPageLength
  • 2049 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1046653587 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • In chemical graph theory, the Szeged index is a topological index of a molecule, used in biochemistry. The Szeged index, introduced by Iván Gutman, generalizes the concept of the Wiener index introduced by Harry Wiener. The Szeged index of a connected graph G is defined as If e is an edge of G connecting vertices u and v, then we write e = uv or e = vu. For , let and be respectively the number of vertices of G lying closer to vertex u than to vertex v and the number of vertices of G lying closer to vertex v than to vertex u. (en)
rdfs:label
  • Szeged index (en)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License