Volume 8, Issue 1 (5-2013)
IJMSI 2013, 8(1): 105-109 |
Back to browse issues page
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Ramane H S, Gutman I, Ganagi A B. On Diameter of Line Graphs. IJMSI 2013; 8 (1) :105-109
URL: http://ijmsi.ir/article-1-407-en.html
URL: http://ijmsi.ir/article-1-407-en.html
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$.
Type of Study: Research paper |
Subject:
General
| Rights and permissions | |
 |
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. |
