Detour eccentric and detour distance degree sequences in graphs

Autor:	K. R. Sandeep Narayan, M. S. Sunitha
Rok vydání:	2015
Předmět:	Combinatorics Degree (graph theory) Discrete Mathematics and Combinatorics Eccentric Computer Science::Social and Information Networks Mathematics Counterexample
Zdroj:	Discrete Mathematics, Algorithms and Applications. :1550022
ISSN:	1793-8317 1793-8309
DOI:	10.1142/s1793830915500226
Popis:	In this paper we define the detour eccentric sequences and detour distance degree sequences of graphs. Some of the properties of these sequences are analyzed. It is observed that certain of these properties behave differently to their counterpart if defined using detour distance and these facts are established by providing suitable counterexamples. The concept of detour distance distributions in graphs is also discussed.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::16772ba03a1f4dae60e13c8345d5953f https://doi.org/10.1142/s1793830915500226 Zobrazit plný text záznamu