A theorem on graph valence shells

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Recently Randić [1] has proposed a set of new graph invariants: the graph valence shells. A valence shell s(u)k is the sum of valences (degrees) of all vertices placed at distance k - 1 from vertex u. The graph valence shell sk, is the sum of valence shells s(u)k. Consider an acyclic graph T. It has been proved that sk = pk - 1 + Pk, where pk denotes the number of paths of length k in T.

Original languageEnglish
Pages (from-to)279-286
Number of pages8
JournalMatch
Volume44
Publication statusPublished - 2001

Fingerprint

Shell
Graph in graph theory
Theorem
Graph Invariants
Denote
Path
Vertex of a graph

ASJC Scopus subject areas

  • Chemistry(all)
  • Computational Theory and Mathematics
  • Computer Science Applications
  • Applied Mathematics

Cite this

A theorem on graph valence shells. / Lukovits, I.

In: Match, Vol. 44, 2001, p. 279-286.

Research output: Contribution to journalArticle

Lukovits, I 2001, 'A theorem on graph valence shells', Match, vol. 44, pp. 279-286.
Lukovits, I. / A theorem on graph valence shells. In: Match. 2001 ; Vol. 44. pp. 279-286.
@article{8eb5e66b78fe4629a3f09a50baa54442,
title = "A theorem on graph valence shells",
abstract = "Recently Randić [1] has proposed a set of new graph invariants: the graph valence shells. A valence shell s(u)k is the sum of valences (degrees) of all vertices placed at distance k - 1 from vertex u. The graph valence shell sk, is the sum of valence shells s(u)k. Consider an acyclic graph T. It has been proved that sk = pk - 1 + Pk, where pk denotes the number of paths of length k in T.",
author = "I. Lukovits",
year = "2001",
language = "English",
volume = "44",
pages = "279--286",
journal = "Match",
issn = "0340-6253",
publisher = "University of Kragujevac, Faculty of Science",

}

TY - JOUR

T1 - A theorem on graph valence shells

AU - Lukovits, I.

PY - 2001

Y1 - 2001

N2 - Recently Randić [1] has proposed a set of new graph invariants: the graph valence shells. A valence shell s(u)k is the sum of valences (degrees) of all vertices placed at distance k - 1 from vertex u. The graph valence shell sk, is the sum of valence shells s(u)k. Consider an acyclic graph T. It has been proved that sk = pk - 1 + Pk, where pk denotes the number of paths of length k in T.

AB - Recently Randić [1] has proposed a set of new graph invariants: the graph valence shells. A valence shell s(u)k is the sum of valences (degrees) of all vertices placed at distance k - 1 from vertex u. The graph valence shell sk, is the sum of valence shells s(u)k. Consider an acyclic graph T. It has been proved that sk = pk - 1 + Pk, where pk denotes the number of paths of length k in T.

UR - http://www.scopus.com/inward/record.url?scp=0035746463&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035746463&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0035746463

VL - 44

SP - 279

EP - 286

JO - Match

JF - Match

SN - 0340-6253

ER -