Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Fouzul Atik"'
Publikováno v:
IEEE Open Journal of the Computer Society, Vol 5, Pp 290-302 (2024)
Gossip algorithms are often considered suitable for wireless sensor networks (WSNs) because of their simplicity, fault tolerance, and adaptability to network changes. They are based on the idea of distributed information dissemination, where each nod
Externí odkaz:
https://doaj.org/article/fc2e7a7544244bbbb7a2ee28b9e5d346
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 19, Iss 3, Pp 276-281 (2022)
AbstractThe distance matrix of a simple connected graph G is [Formula: see text] where dij is the length of a shortest path between the ith and jth vertices of G. Eigenvalues of D(G) are called the distance eigenvalues of G. The m-generation n-prism
Externí odkaz:
https://doaj.org/article/388ef327ba4a4a30a1eec9f1420313c0
Publikováno v:
IEEE Networking Letters. 4:142-146
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::883715a1356917126b71ba3932100b3a
https://doi.org/10.1109/lnet.2022.3181203
https://doi.org/10.1109/lnet.2022.3181203
Publikováno v:
Discrete Mathematics, Algorithms and Applications.
A signed network [Formula: see text] with the underlying graph [Formula: see text], used as a mathematical model for analyzing social networks, has each edge in [Formula: see text] with a weight [Formula: see text] or [Formula: see text] assigned by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a4a328dd1c2175655d9cec45640c8625
https://doi.org/10.1142/s1793830923500428
https://doi.org/10.1142/s1793830923500428
Autor:
Fouzul Atik, Priti Prasanna Mondal
Publikováno v:
Asian-European Journal of Mathematics. 16
The distance, distance signless Laplacian and distance Laplacian matrix of a simple connected graph [Formula: see text] are denoted by [Formula: see text] and [Formula: see text] respectively, where [Formula: see text] is the diagonal matrix of verte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0c86f679541a5f352e61ea992e37d69b
https://doi.org/10.1142/s1793557123500717
https://doi.org/10.1142/s1793557123500717
Publikováno v:
ICCCNT
A dam is a man-made structural barrier built to store and control the flow of water in lakes or rivers. However, mismanagement of dams or extreme weather conditions lead to man-made or natural disasters respectively. Therefore, it is crucial to devel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::941900788a1b9423ba638dc8c21b1f29
https://doi.org/10.1109/icccnt51525.2021.9579945
https://doi.org/10.1109/icccnt51525.2021.9579945
Autor:
Annem Keerthi, B. S. V. Naga Jahnavi, Fouzul Atik, Ayesha Sameer Sheikh, Guntakala Likhita, Sateeshkrishna Dhuli
Publikováno v:
ICCCNT
IoT contains a large amount of data as well as privacy sensitive information. This information can be easily identified by the various cyber-attackers. Attackers may steel the data or they can introduce viruses and other malicious software to damage
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0a1f639c313cbbaee03bc2b7bc95695c
https://doi.org/10.1109/icccnt51525.2021.9579502
https://doi.org/10.1109/icccnt51525.2021.9579502
Publikováno v:
Linear and Multilinear Algebra. 69:2607-2619
The distance matrix of a simple connected graph G is D(G)=(dij), where dij is the distance between the vertices i and j in G. We consider a weighted tree T on n vertices with edge weights are squar...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d2e0a2fbc360de688bb2eff20962fae0
https://doi.org/10.1080/03081087.2019.1687642
https://doi.org/10.1080/03081087.2019.1687642
Autor:
Fouzul Atik
Publikováno v:
Linear and Multilinear Algebra. 68:2143-2156
A partition of a square matrix A is said to be equitable if all the blocks of the partitioned matrix have constant row sums and each of the diagonal blocks are of square order. A quotient matrix Q ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b98167469d7150770fd6b9c9325ee674
https://doi.org/10.1080/03081087.2019.1572708
https://doi.org/10.1080/03081087.2019.1572708
Publikováno v:
Linear and Multilinear Algebra. 68:323-336
The resistance matrix of a simple connected graph G is denoted by RG or simply by R and is defined by RG=(rij), where rij is the resistance distance between the vertices i and j in G. In this paper...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bb5c75eef0614e7838e890b6cae0a74f
https://doi.org/10.1080/03081087.2018.1505822
https://doi.org/10.1080/03081087.2018.1505822