On Diameter of Line Graphs
Authors
Abstract:
The diameter of a connected graph $G$, denoted by $diam(G)$, is the maximum distance between any pair of vertices of $G$. Let $L(G)$ be the line graph of $G$. We establish necessary and sufficient conditions under which for a given integer $k geq 2$, $diam(L(G)) leq k$.
similar resources
On Harmonic Index and Diameter of Unicyclic Graphs
The Harmonic index $ H(G) $ of a graph $ G $ is defined as the sum of the weights $ dfrac{2}{d(u)+d(v)} $ of all edges $ uv $ of $G$, where $d(u)$ denotes the degree of the vertex $u$ in $G$. In this work, we prove the conjecture $dfrac{H(G)}{D(G)} geq dfrac{1}{2}+dfrac{1}{3(n-1)} $ given by Jianxi Liu in 2013 when G is a unicyclic graph and give a better bound $ dfrac{H(G)}{D(G)}geq dfra...
full textOn cliques in diameter graphs
Note that we assume of the sphere being embedded in R, and the unit distance included from the ambient space. Diameter graphs arise naturally in the context of Borsuk’s problem. In 1933 Borsuk [3] asked whether any set of diameter 1 in R can be partitioned into (d+1) parts of strictly smaller diameter. The positive answer to this question is called Borsuk’s conjecture. This was shown to be true...
full textDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
full textOriented diameter of graphs with diameter 3
In 1978, Chvátal and Thomassen proved that every 2-edge-connected graph with diameter 2 has an orientation with diameter at most 6. They also gave general bounds on the smallest value f(d) such that every 2-edge-connected graph G with diameter d has an orientation with diameter at most f(d). For d = 3, their general bounds reduce to 8 ≤ f(3) ≤ 24. We improve these bounds to 9 ≤ f(3) ≤ 11.
full textMinimum diameter and cycle-diameter orientations on planar graphs
Let G be an edge weighted undirected graph. For every pair of nodes consider the shortest cycle containing these nodes in G. The cycle diameter of G is the maximum length of a cycle in this set. Let H be a directed graph obtained by directing the edges of G. The cycle diameter of H is similarly defined except for that cycles are replaced by directed closed walks. Is there always an orientation ...
full textOn the Diameter of Random Planar Graphs
We show that the diameter D(Gn) of a random labelled connected planar graph with n vertices is asymptotically almost surely of order n1/4, in the sense that there exists a constant c > 0 such that P (D(Gn) ∈ (n1/4− , n )) ≥ 1− exp(−n ) for small enough and n large enough (n ≥ n0( )). We prove similar statements for rooted 2-connected and 3-connected maps and planar graphs.
full textMy Resources
Journal title
volume 8 issue None
pages 105- 109
publication date 2013-05
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023