The Connected Detour Numbers of Special Classes of Connected Graphs

Ahmed M. Ali and Ali A. Ali

Journal of Mathematics, 2019, vol. 2019, 1-9

Abstract:

Simple finite connected graphs of vertices are considered in this paper. A connected detour set of is defined as a subset such that the induced subgraph is connected and every vertex of lies on a detour for some . The connected detour number of a graph is the minimum order of the connected detour sets of . In this paper, we determined for three special classes of graphs , namely, unicyclic graphs, bicyclic graphs, and cog-graphs for , , and .

Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/JMATH/2019/8272483.pdf (application/pdf)
http://downloads.hindawi.com/journals/JMATH/2019/8272483.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:8272483

DOI: 10.1155/2019/8272483

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().