Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/3340
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBalachandran, Niranjan-
dc.contributor.authorP, Sajith-
dc.contributor.authorMishra, Tapas Kumar-
dc.contributor.authorL, Sunil Chandran-
dc.date.accessioned2019-08-26T09:56:08Z-
dc.date.available2019-08-26T09:56:08Z-
dc.date.issued2019-06-
dc.identifier.citationResearch Initiation Workshop, IISc Bangalore,10-16 June 2019.en_US
dc.identifier.urihttp://hdl.handle.net/2080/3340-
dc.descriptionCopyright of this document belongs to proceedings publisher.en_US
dc.description.abstractLet n and k be integers, n ≥ k ≥ 1. A graph G is said to admit property Pk if for any distinct pair x, y ∈ V (G), there exists k internally vertex disjoint paths between x and y of the same length. Consider the following family of graphs. G n k := {Gn : Gn admits property Pk}. There are two interesting directions in the study of G n k . Firstly, in the extremal direction, it is interesting to estimate the sparsity of graphs admitting property Pk. That is, estimation of ν(n, k) = min{|E(Gn)| : Gn ∈ Gn k }. The other direction is structural: what properties in the graph ensures admittance of property Pk. In this paper, we tackle the extremal question followed by some structural results on the same.en_US
dc.subjectGraph Gen_US
dc.subjectDisjoint pathsen_US
dc.titleEquidistant Paths in Graphsen_US
dc.typeArticleen_US
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
2019_RIW_TKMishra_Equidistant.pdfConference Paper184.46 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.