|
|
|
|
On Strongly *-graph
|
|
|
|
|
|
|
|
نویسنده
|
seoud m.a.-a. ,roshdy e.m. ,aboshady m.s.
|
|
منبع
|
proceedings of the pakistan academy of sciences - 2017 - دوره : 54 - شماره : 2 - صفحه:179 -195
|
|
چکیده
|
A graph g = (v,e) is said to be strongly *-graph if there exists a bijection f ∶ v → {1,2,…,n} in such a way that when an edge,whose vertices are labeled i and j,is labeled with the value i + j + ij,all edge labels are distinct. in this paper we get an upper bound for the number of edges of any graph with n vertices to be strongly *-graph,and we make an algorithm to check any graph if it is a strongly *-graph or not. also,we study some new families to be strongly *-graph. © pakistan academy of sciences.
|
|
کلیدواژه
|
C++ programming Language; Strongly *-graph/labeling
|
|
آدرس
|
department of mathematics,faculty of science,ain shams university,abbassia,cairo, Egypt, department of basic & applied sciences,arab academy of science,technology and maritime transport,cairo, Egypt, department of engineering physics and mathematics,faculty of engineering,ain shams university,cairo, Egypt
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|