Login
Register
Reset Password
Publish & Distribute
Publishing Solutions
Distribution Solutions
Subjects
Architecture and Design
Arts
Business and Economics
Chemistry
Classical and Ancient Near Eastern Studies
Computer Sciences
Cultural Studies
Engineering
General Interest
Geosciences
History
Industrial Chemistry
Jewish Studies
Law
Library and Information Science, Book Studies
Life Sciences
Linguistics and Semiotics
Literary Studies
Materials Sciences
Mathematics
Medicine
Music
Pharmacy
Philosophy
Physics
Social Sciences
Sports and Recreation
Theology and Religion
Publications
Journals
Books
Proceedings
Publishers
Blog
Contact
Search
EUR
USD
GBP
English
English
Deutsch
Polski
Español
Français
Italiano
Cart
Home
Journals
Applied Mathematics and Nonlinear Sciences
Volume 2 (2017): Issue 1 (January 2017)
Open Access
Computing topological indices of the line graphs of Banana tree graph and Firecracker graph
Muhammad Shoaib Sardar
Muhammad Shoaib Sardar
,
Sohail Zafar
Sohail Zafar
and
Zohaib Zahid
Zohaib Zahid
| Mar 13, 2017
Applied Mathematics and Nonlinear Sciences
Volume 2 (2017): Issue 1 (January 2017)
About this article
Previous Article
Next Article
Abstract
Article
Figures & Tables
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Published Online:
Mar 13, 2017
Page range:
83 - 92
Received:
Nov 06, 2016
Accepted:
Mar 13, 2017
DOI:
https://doi.org/10.21042/AMNS.2017.1.00007
Keywords
Banana tree graph
,
Firecracker graph
,
Topological indices
,
line graph
© 2017 Muhammad Shoaib Sardar, Sohail Zafar and Zohaib Zahid, published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.
Fig. 1
The Banana tree graph B3,5.
Fig. 2
The line graph of Banana tree graph B3,5.
Fig. 3
The Firecracker graph F4,7.
Fig. 4
The line graph of Firecracker graph F4,7.
The size partition of G.
(
S
u
,S
v
) :
uv ∈ E
(
G
)
(2
k
+ 3,
k
2
− 4
k
+ 7)
(2
k
+ 3,2
k
+ 7)
(2
k
+ 3,
k
2
− 4
k
+ 11)
(2
k
+ 7,
k
2
− 4
k
+ 11)
Number of edges
2
2
2
2
(
S
u
,S
v
) :
uv ∈ E
(
G
)
(2
k
+ 7,
k
2
− 4
k
+ 12)
(2
k
+ 7,2
k
+ 8)
(2
k
+ 8,2
k
+ 8)
(
k
2
− 4
k
+ 5,
k
2
− 4
k
+ 7)
Number of edges
2
2
n
− 6
2(
k
− 2)
(
S
u
,S
v
) :
uv ∈ E
(
G
)
(
k
2
− 4
k
+ 6,
k
2
− 4
k
+ 7)
(
k
2
− 4
k
+ 11,
k
2
− 4
k
+ 6)
(
k
2
− 4
k
+ 12,
k
2
− 4
k
+ 6)
(
k
2
− 4
k
+ 12,2
k
+ 8)
Number of edges
(
n
−
2
)
(
k
2
−
5
k
+
6
)
2
$\begin{array}{} \displaystyle \frac{{(n - 2)({k^2} - 5k + 6)}}{2} \end{array}$
2(
k
− 2)
(
n
− 4)(
k
− 2)
2(
n
− 5)
(
S
u
,S
v
) :
uv ∈ E
(
G
)
(
k
2
− 4
k
+ 5,
k
2
− 4
k
+ 7)
Number of edges
k
2
− 5
k
+ 6