Please use this identifier to cite or link to this item:
http://hdl.handle.net/2080/3340
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Balachandran, Niranjan | - |
dc.contributor.author | P, Sajith | - |
dc.contributor.author | Mishra, Tapas Kumar | - |
dc.contributor.author | L, Sunil Chandran | - |
dc.date.accessioned | 2019-08-26T09:56:08Z | - |
dc.date.available | 2019-08-26T09:56:08Z | - |
dc.date.issued | 2019-06 | - |
dc.identifier.citation | Research Initiation Workshop, IISc Bangalore,10-16 June 2019. | en_US |
dc.identifier.uri | http://hdl.handle.net/2080/3340 | - |
dc.description | Copyright of this document belongs to proceedings publisher. | en_US |
dc.description.abstract | Let 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.subject | Graph G | en_US |
dc.subject | Disjoint paths | en_US |
dc.title | Equidistant Paths in Graphs | en_US |
dc.type | Article | en_US |
Appears in Collections: | Conference Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
2019_RIW_TKMishra_Equidistant.pdf | Conference Paper | 184.46 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.