Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Imrana Kousar"'
Publikováno v:
AIMS Mathematics, Vol 6, Iss 8, Pp 8466-8476 (2021)
The graph energy E(G) of a simple graph G is sum of its absolute eigenvalues where eigenvalues of adjacency matrix A(G) are referred as eigenvalues of graph G. Depends upon eigenvalues of different graph matrices, several graph energies has been obse
Externí odkaz:
https://doaj.org/article/2625c284afdc466f9d282f2635665e26
Publikováno v:
IEEE Access, Vol 8, Pp 109801-109806 (2020)
Many variations of graph labeling has been defined in the literature. e.g., graceful, harmonious and radio labeling etc. In information technology and in data sciences, we need secrecy of data, different channel assignment and accuracy of transmissio
Externí odkaz:
https://doaj.org/article/90fd85fffe7848d682cb83b277230389
Publikováno v:
Journal of Mathematics, Vol 2020 (2020)
Graph theory and its wide applications in natural sciences and social sciences open a new era of research. Making the graph of computer networks and analyzing it with aid of graph theory are extensively studied and researched in the literature. An im
Externí odkaz:
https://doaj.org/article/5ffc96826d2a4d45b6d3706756532aa1
Autor:
Muhammad Junaid, Imrana Kousar, Shagufta Gulbadan, Muhammad Azhar Khan, Muhammad Asif Yousuf, Mirza Mahmood Baig, Ghulam Abbas Ashraf, H.H. Somaily, Manal Morsi
Publikováno v:
Physica B: Condensed Matter. 641:414120
Autor:
Waqas Nazeer, Shin Min Kang, Saima Nazeer, Mobeen Munir, Imrana Kousar, Ammara Sehar, Young Chel Kwun
Publikováno v:
Symmetry, Vol 8, Iss 12, p 145 (2016)
A vertex v is a peripheral vertex in G if its eccentricity is equal to its diameter, and periphery P ( G ) is a subgraph of G induced by its peripheral vertices. Further, a vertex v in G is a central vertex if e ( v ) = r a d ( G ) , and the subgraph
Externí odkaz:
https://doaj.org/article/fed6100e8b604e07b61c6e7ae678b974
Publikováno v:
Journal of Mathematics, Vol 2020 (2020)
Graph theory and its wide applications in natural sciences and social sciences open a new era of research. Making the graph of computer networks and analyzing it with aid of graph theory are extensively studied and researched in the literature. An im
Publikováno v:
Journal of applied mathematics & informatics. 34:451-465
Publikováno v:
Scopus-Elsevier
Publikováno v:
Journal of applied mathematics & informatics. 33:173-183
A radio k-labeling f of a graph G is a function f from V (G) to such that for every two distinct vertices x and y of G, where d(x, y) is the distance between any two vertices . The span of a radio k-labeling f is denoted by sp(f) and defined as max.
Autor:
Mobeen Munir, Imrana Kousar, Ammara Sehar, Saima Nazeer, Young Chel Kwun, Shin Min Kang, Waqas Nazeer
Publikováno v:
Symmetry; Volume 8; Issue 12; Pages: 145
Symmetry, Vol 8, Iss 12, p 145 (2016)
Symmetry, Vol 8, Iss 12, p 145 (2016)
A vertex v is a peripheral vertex in G if its eccentricity is equal to its diameter, and periphery P ( G ) is a subgraph of G induced by its peripheral vertices. Further, a vertex v in G is a central vertex if e ( v ) = r a d ( G ) , and the subgraph