|
|
|
|
Indexable and strongly indexable graphs
|
|
|
|
|
|
|
|
نویسنده
|
seoud m.a.-a. ,abdel-hamid g.m. ,abo shady m.s.a.-a.
|
|
منبع
|
proceedings of the pakistan academy of sciences - 2012 - دوره : 49 - شماره : 2 - صفحه:139 -144
|
|
چکیده
|
Let g = (v,e) be an (n,m) graph. g is said to be strongly indexable if there exists a bijection f: v → {0,1,2,......,n - 1},such that f+(e) = {1,2,...where f+(uv) = f(u) + f(v) for any edge uv ε e. g is said to be indexable if f+ is injective on e. in this paper we construct classes of indexable graphs,and we give an upper bound for the number of edges of any graph on n vertices to be indexable. also,we determine all indexable graphs of order ≤ 6. © pakistan academy of sciences.
|
|
کلیدواژه
|
C++ programming language; Indexable graph/labeling; Strongly Indexable graph
|
|
آدرس
|
department of mathematics,ain shams university,abbassia, Egypt, department of mathematics,military technical college,kobry elkobba, Egypt, department of mathematics,ain shams university,abbassia, Egypt
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|