Mircea V. Diudea (Author), Csaba L. Nagy (Author), Petra Žigert Pleteršek (Author), Sandi Klavžar (Author)

Abstract

Cluj polynomials are defined on the unsymmetric Cluj matrices or by a cutting procedure, as the counting polynomials which collect the vertex proximities in the graph. On these proximities, two Cluj polynomials CJS and CJP and the PIv polynomial can be defined. Formulas for these counting polynomials are derived in case of tori of several tessellation.

Keywords

Cluj polynomial;couting polynomial;torus;

Data

Language: English
Year of publishing:
Typology: 1.01 - Original Scientific Article
Organization: UL FMF - Faculty of Mathematics and Physics
UDC: 519.17
COBISS: 15037206 Link will open in a new window
ISSN: 1224-7154
Views: 1766
Downloads: 21
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

Secondary language: English
URN: URN:SI:UM:
Pages: str. 113-123
Volume: ǂVol. ǂ55
Issue: ǂno. ǂ4
Chronology: 2010
ID: 67546