Diametral paths in extended transformation graphs

Sharma, Manali; Garg, Pravin

dc.contributor.author	Sharma, Manali	en_US
dc.contributor.author	Garg, Pravin	en_US
dc.date.accessioned	2021-01-13T10:56:57Z
dc.date.available	2021-01-13T10:56:57Z
dc.date.issued	2021
dc.identifier.citation	Sharma, M. & Garg, P. (2021). Diametral paths in extended transformation graphs. TWMS Journal of Applied and Engineering Mathematics, 11(SI), 75-87.	en_US
dc.identifier.issn	2146-1147
dc.identifier.issn	2587-1013
dc.identifier.uri	https://hdl.handle.net/11729/3022
dc.identifier.uri	http://jaem.isikun.edu.tr/web/index.php/archive/109-vol11-special-issue/636
dc.description.abstract	In a graph, diametral path is shortest path between two vertices which has length equal to diameter of the graph. Number of diametral paths plays an important role in computer science and civil engineering. In this paper, we introduce the concept of extended transformation graphs. There are 64 extended transformation graphs. We obtain number of diametral paths in some of the extended transformation graphs and we also study the semi-complete property of these extended transformation graphs. Further, a program is given for obtaining number of diametral paths.	en_US
dc.language.iso	eng	en_US
dc.publisher	Işık University Press	en_US
dc.rights	info:eu-repo/semantics/openAccess	en_US
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 United States	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.subject	Diameter	en_US
dc.subject	Diametral path	en_US
dc.subject	Transformation graph	en_US
dc.subject	Semi-complete graph	en_US
dc.title	Diametral paths in extended transformation graphs	en_US
dc.type	article	en_US
dc.relation.journal	TWMS Journal of Applied and Engineering Mathematics	en_US
dc.identifier.volume	11
dc.identifier.issue	SI
dc.identifier.startpage	75
dc.identifier.endpage	87
dc.relation.publicationcategory	Makale - Uluslararası Hakemli Dergi - Başka Kurum Yazarı	en_US