On Strongly *-Graphs | [Proceedings of the Pakistan Academy of Sciences: A. Physical and Computational Sciences • 2017]

Author(s):

1. Mohamed Abdel-Azim Seoud: Department of Mathematics, Faculty of Science, Ain Shams University,Abbassia, Cairo,Egypt

2. Eliwa Mohamed Roshdy: Department of Basic & Applied Sciences, Arab Academy of Science, Technology and Maritime Transport,Cairo,Egypt

3. Mohamed Saied AboShady: Department of Engineering Physics and Mathematics, Faculty of Engineering, Ain Shams University,Cairo,Egypt

Abstract:

A graph ???? = (????, ????) is said to be strongly *-graph if there exists a bijection ???? : ???? → {1,2, … , ????} in such a way that when an edge, whose vertices are labeled ???? and ????, is labeled with the value ???? + ???? + ????????, all edge labels are distinct. In this paper we get an upper bound for the number of edges of any graph with ???? 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*- graphs.

Page(s): 179-195

DOI: DOI not available

Published: Journal: Proceedings of the Pakistan Academy of Sciences: A. Physical and Computational Sciences, Volume: 54, Issue: 2, Year: 2017

Keywords:

Strongly graph labeling , C++ programming Language

References:

References are not available for this document.

Citations

Citations are not available for this document.

Citations

Downloads

Views