The PI index of polyomino chains of 4k-cycles

Toufik Mansour; Matthias Schork

doi:10.1007/s10440-008-9339-7

The PI index of polyomino chains of 4k-cycles

Toufik Mansour, Matthias Schork

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

The Padmakar-Ivan (PI) index of a graph G is the sum over all edges uv of G of the number of edges which are not equidistant from the vertices u and v. In this paper we compute the PI index of polyomino chains of 4k-cycles and establish bounds for it.

Original language	English
Pages (from-to)	671-681
Number of pages	11
Journal	Acta Applicandae Mathematicae
Volume	109
Issue number	3
DOIs	https://doi.org/10.1007/s10440-008-9339-7
State	Published - Mar 2010

Keywords

Graph invariant
PI index
Polyomino chain

ASJC Scopus subject areas

Applied Mathematics

Access to Document

10.1007/s10440-008-9339-7

Cite this

@article{205100b07a984464b53c107d6a208b4f,

title = "The PI index of polyomino chains of 4k-cycles",

abstract = "The Padmakar-Ivan (PI) index of a graph G is the sum over all edges uv of G of the number of edges which are not equidistant from the vertices u and v. In this paper we compute the PI index of polyomino chains of 4k-cycles and establish bounds for it.",

keywords = "Graph invariant, PI index, Polyomino chain",

author = "Toufik Mansour and Matthias Schork",

year = "2010",

month = mar,

doi = "10.1007/s10440-008-9339-7",

language = "English",

volume = "109",

pages = "671--681",

journal = "Acta Applicandae Mathematicae",

issn = "0167-8019",

publisher = "Springer Netherlands",

number = "3",

}

TY - JOUR

T1 - The PI index of polyomino chains of 4k-cycles

AU - Mansour, Toufik

AU - Schork, Matthias

PY - 2010/3

Y1 - 2010/3

N2 - The Padmakar-Ivan (PI) index of a graph G is the sum over all edges uv of G of the number of edges which are not equidistant from the vertices u and v. In this paper we compute the PI index of polyomino chains of 4k-cycles and establish bounds for it.

AB - The Padmakar-Ivan (PI) index of a graph G is the sum over all edges uv of G of the number of edges which are not equidistant from the vertices u and v. In this paper we compute the PI index of polyomino chains of 4k-cycles and establish bounds for it.

KW - Graph invariant

KW - PI index

KW - Polyomino chain

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

U2 - 10.1007/s10440-008-9339-7

DO - 10.1007/s10440-008-9339-7

M3 - Article

AN - SCOPUS:77949266075

SN - 0167-8019

VL - 109

SP - 671

EP - 681

JO - Acta Applicandae Mathematicae

JF - Acta Applicandae Mathematicae

IS - 3

ER -

The PI index of polyomino chains of 4k-cycles

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this