Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Hafiz Mutee ur Rehman"'
Publikováno v:
Journal of Mathematics, Vol 2022 (2022)
Energy of a graph is defined as the sum of the absolute values of the eigenvalues of the adjacency matrix associated with the graph. In this research work, we find color energy, distance energy, Laplacian energy, and Seidel energy for the Dutch windm
Externí odkaz:
https://doaj.org/article/d5b3d2c1983d4fa099b162b65b2d7a82
Publikováno v:
Discrete Dynamics in Nature and Society, Vol 2018 (2018)
The aim of this report to solve the open problem suggested by Chen et al. We study the graph entropy with ABC edge weights and present bounds of it for connected graphs, regular graphs, complete bipartite graphs, chemical graphs, tree, unicyclic grap
Externí odkaz:
https://doaj.org/article/8dda79bc52c24f0597a42b5336a22214
Autor:
Ammar Alsinai, Hafiz Mutee ur Rehman, Yasir Manzoor, Murat Cancan, Ziyattin Taş, Moahmmad Reza Farahani
Sheehalli and Kanabur presented new forms of topological indices known as SK indices which have many applications in chemical graph theory towards QSPR/QSAR. A simple connected graph Gamma is called a cactus graph if and only if any two cycles in the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2347bed9debd4c13232e0f938d2df88d
https://avesis.yyu.edu.tr/publication/details/6f78476c-70b0-41c7-8321-049f160af27f/oai
https://avesis.yyu.edu.tr/publication/details/6f78476c-70b0-41c7-8321-049f160af27f/oai
Publikováno v:
Mathematical Problems in Engineering.
Measurements of graphs and retrieving structural information of complex networks using degree-based network entropy have become an informational theoretical concept. This terminology is extended by the concept of Shannon entropy. In this paper, we in
Publikováno v:
Mathematical Problems in Engineering, Vol 2020 (2020)
Motivated by the concept of Shannon’s entropy, the degree-dependent weighted graph entropy was defined which is now become a tool for measurement of structural information of complex graph networks. The aim of this paper is to study weighted graph
Autor:
Hafiz Mutee ur Rehman, Suad Younus A. AL-Mayyahi AL-Mayyahi, Mohanad A. Mohammed, Abaid ur Rehman Virk
Publikováno v:
Proyecciones (Antofagasta) v.39 n.4 2020
SciELO Chile
CONICYT Chile
instacron:CONICYT
SciELO Chile
CONICYT Chile
instacron:CONICYT
Among topological descriptors topological indices are significant and they have a conspicuous role in chemistry. Dutch Windmill graph D x y can be obtain by taking x copies of cycle C y with a vertex in common. In this paper, we will compute some irr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ddaea84feaab6dfc45bc784088f20d2f
http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172020000400903
http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172020000400903
Dendrimers are constructed by the successive addition of layers of branching groups. Topological indices are numerical numbers associated which are graph invariant up to isomorphism. In this report, we give closed form of M-polynomial of PETAA dendri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b21c0c0e4d0463b0c37cf815377a4a7
https://avesis.yyu.edu.tr/publication/details/24c8ca1e-3312-4622-b99f-7604453fa82e/oai
https://avesis.yyu.edu.tr/publication/details/24c8ca1e-3312-4622-b99f-7604453fa82e/oai
Publikováno v:
Discrete Dynamics in Nature and Society, Vol 2020 (2020)
The graph entropy was proposed by Körner in the year 1973 when he was studying the problem of coding in information theory. The foundation of graph entropy is in information theory, but it was demonstrated to be firmly identified with some establish
Publikováno v:
Open Journal of Mathematical Sciences, Vol 1, Iss 1, Pp 62-71 (2017)
A topological index is a real number related to a molecular graph, which is a graph invariant. Uptill now there are several topological indices are defined. Some of them are distance based while the others are degree based, all have found numerous ap
Publikováno v:
Discrete Dynamics in Nature and Society, Vol 2020 (2020)
The graph entropy was proposed by Körner in the year 1973 when he was studying the problem of coding in information theory. The foundation of graph entropy is in information theory, but it was demonstrated to be firmly identified with some establish
Externí odkaz:
https://doaj.org/article/c9e8aa17ae3b41d8820d3e85f9adba4b