Volume 15 - Issue 1
Distance Parameters for a Ferrers Graph
Abstract
A simple graph G = (V, E) is a Ferrers graph if for all distinct x, y, z, w ∈ V if xy ∈ E and zw ∈ E then either xw ∈ E oryz ∈ E. Since xy ∈E⇔yx ∈ E holds for all simple graphs, the definition of Ferrers graph must be extended to ifxy ∈ E and zw ∈ E then either xw ∈ E or yz ∈ E or yw ∈E or xz ∈ E .It is shown that, for a ferrers graph d(u,v) ≤ 3 for all vertices 𝑢𝑢,𝑣𝑣∈𝑉𝑉(𝐺𝐺).
Paper Details
PaperID: 191023
Author's Name: R. Chenthil Thanga Bama, S. Sujitha and S. Durai Raj
Volume: Volume 15
Issues: Issue 1
Keywords: Ferrers Graph, Ferrers Tree, Distance, Diameter, Radius.
Year: 2019
Month: February
Pages: 193-196