Zobrazeno 1 - 10
of 78
pro vyhledávání: '"Sakander Hayat"'
Publikováno v:
Heliyon, Vol 10, Iss 8, Pp e29304- (2024)
A convex hull of finitely many points in the Euclidean space Rd is known as a convex polytope. Graphically, they are planar graphs i.e. embeddable on R2. Minimum dominating sets possess diverse applications in computer science and engineering. Locati
Externí odkaz:
https://doaj.org/article/9cc7424f20b14c38ae55f3f2a54ccba7
Publikováno v:
Ain Shams Engineering Journal, Vol 15, Iss 3, Pp 102586- (2024)
Quantitative structure-property relationship (QSPR) modeling employs contemporary mathematical tools to predict physicochemical, thermodynamic and biological properties of compounds from their chemical structures. Graphical indices provide those math
Externí odkaz:
https://doaj.org/article/ec081f1ef2fa42be96660720c013a3c9
Publikováno v:
Alexandria Engineering Journal, Vol 80, Iss , Pp 259-268 (2023)
Introduced by Gutman & Trinajstić in 1972, the two well-known Zagreb indices efficiently determine the total π-electron energy of alternant hydrocarbons. The hyper-Zagreb index is a variant of the classical first Zagreb index. A tree is an acyclic
Externí odkaz:
https://doaj.org/article/8b6f067b31514137a2205af00b5284f9
Publikováno v:
Heliyon, Vol 10, Iss 1, Pp e23392- (2024)
The Sombor index, introduced by Gutman in 2021, represents a novel graphical topological descriptor reliant upon graph degree information. It holds promise for elucidating the thermodynamic behavior of compounds. Denoting by Vnk (respectively, Enk) t
Externí odkaz:
https://doaj.org/article/28441e5520ca42dfa8398572039b4084
Publikováno v:
Axioms, Vol 13, Iss 6, p 342 (2024)
For a graph G=(VG,EG), a degree-based graphical index GId takes the general form GId=∑xy∈EGϕ(dx,dy), where ϕ is a symmetric map and di is the degree of i∈VG. For α∈R, if ϕ=(dxdy)α (resp. ϕ=(dx+dy)α), the index is called the general pro
Externí odkaz:
https://doaj.org/article/285c4d14e31e474fa8a10d6c0d9a80b3
Autor:
Sakander Hayat, Raman Sundareswaran, Marayanagaraj Shanmugapriya, Asad Khan, Venkatasubramanian Swaminathan, Mohamed Hussian Jabarullah, Mohammed J. F. Alenazi
Publikováno v:
Symmetry, Vol 16, Iss 6, p 663 (2024)
Claude Berge (1987) introduced the concept of k-extendable graphs, wherein any independent set of size k is inherently a constituent of a maximum independent set within a graph H=(V,E). Graphs possessing the property of being 1-extendable are termeda
Externí odkaz:
https://doaj.org/article/8f0b4c5c35454c168956ecf5ff4748b3
Publikováno v:
Alexandria Engineering Journal, Vol 66, Iss , Pp 957-977 (2023)
A neural network is a computer system modeled on the nerve tissue and nervous system. In this sense, neural networks refer to systems of neurons, either organic or artificial in nature. Neural networks have diverse applications in computer graphics,
Externí odkaz:
https://doaj.org/article/16b902d1fb324875ab4787f6f52c3d5d
Autor:
Sakander Hayat, Farwa Asmat
Publikováno v:
Mathematics, Vol 11, Iss 10, p 2245 (2023)
Degree sequence measurements on graphs have attracted a lot of research interest in recent decades. Multiplying the degrees of adjacent vertices in graph Ω provides the multiplicative first Zagreb index of a graph. In the context of graph theory, th
Externí odkaz:
https://doaj.org/article/28730e3053a24d48bbd3211b76d3cc63
Publikováno v:
AIMS Mathematics, Vol 6, Iss 4, Pp 3947-3973 (2021)
In this paper, we have used two different proof techniques to show the Hamilton-connectedness of graphs. By using the vertex connectivity and Hamiltoniancity of graphs, we construct an infinite family of Hamilton-connected convex polytope line graphs
Externí odkaz:
https://doaj.org/article/7c9b09f3d64d4def9bed7762e1ba6e18
Autor:
Sakander Hayat, Hafiz Muhammad Afzal Siddiqui, Muhammad Imran, Hafiz Muhammad Ikhlaq, Jinde Cao
Publikováno v:
AIMS Mathematics, Vol 6, Iss 2, Pp 1833-1850 (2021)
Zero forcing is a process of coloring in a graph in time steps known as propagation time. These graph-theoretic parameters have diverse applications in computer science, electrical engineering and mathematics itself. The problem of evaluating these p
Externí odkaz:
https://doaj.org/article/47e6bfb32f82467ba3c5a3ea6ef0b4b7