Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Divya Sindhu Lekha"'
Publikováno v:
Mathematics, Vol 12, Iss 10, p 1568 (2024)
Weight thresholding (WT) is a method intended to decrease the number of links within weighted networks that may otherwise be excessively dense for network science applications. WT aims to remove links to simplify the network by holding most of the fe
Externí odkaz:
https://doaj.org/article/bddc4585d42047a992d1a54def929a48
Publikováno v:
Mathematics, Vol 11, Iss 16, p 3482 (2023)
In this study, we investigate the effect of weight thresholding (WT) on the robustness of real-world complex networks. Here, we assess the robustness of networks after WT against various node attack strategies. We perform WT by removing a fixed fract
Externí odkaz:
https://doaj.org/article/d8af1635f6ba4b419a802462a14183bd
Publikováno v:
Discrete Applied Mathematics. 319:159-170
The median of a graph consists of those vertices which minimize the average distance to all other vertices. It plays an important role in optimization scenarios like facility location problems. Sierpinski graphs are the state graphs of the Switching
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7baeeba0d108985035811480e9bba1c0
https://doi.org/10.1016/j.dam.2021.02.005
https://doi.org/10.1016/j.dam.2021.02.005
Autor:
Jisha Mariyam John, Divya Sindhu Lekha
Publikováno v:
Complex Networks & Their Applications X ISBN: 9783030934088
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e750bf01d4d70465e6b552c296720d8d
https://doi.org/10.1007/978-3-030-93409-5_70
https://doi.org/10.1007/978-3-030-93409-5_70
Publikováno v:
Physica A: Statistical Mechanics and its Applications. 590:126667
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::530f420d891a1b9e246224fc77d6dc3f
https://doi.org/10.1016/j.physa.2021.126667
https://doi.org/10.1016/j.physa.2021.126667
Autor:
Shilpa Mohandas, Henry Martyn Mulder, Divya Sindhu Lekha, Ajitha R. Subhamathi, Manoj Changat
Publikováno v:
Discrete Applied Mathematics. 228:50-59
A median (antimedian) of a profile of vertices on a graph G is a vertex that minimizes (maximizes) the sum of the distances to the elements in the profile. The median (antimedian) function has as output the set of medians (antimedians) of a profile.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7333b02e66f0a6b653fcd1d193950973
https://doi.org/10.1016/j.dam.2016.04.013
https://doi.org/10.1016/j.dam.2016.04.013
Publikováno v:
Physica A: Statistical Mechanics and its Applications. 549:124347
In this work, we revisit central attacks in complex networks. We simulate simultaneous as well as sequential attacks on networks based on degree (DC), betweenness (BC) and closeness (CC) centralities. We observed the disintegration of giant component
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::127522d90f67af103ef3f9b01e252281
https://doi.org/10.1016/j.physa.2020.124347
https://doi.org/10.1016/j.physa.2020.124347
Publikováno v:
Discrete Optimization. 17:80-88
We introduce a game which is played by two players on a connected graph G . The players I and I I alternatively choose vertices of the graph until all vertices are taken. The set of vertices chosen by player I is denoted by ? I , and by I I is denote
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6996d9f961d0dbd1d84898b3cd64c4be
https://doi.org/10.1016/j.disopt.2015.05.002
https://doi.org/10.1016/j.disopt.2015.05.002
Publikováno v:
International Journal of Data Science. 4:162
Reliant components of a network are the connector nodes which aid in establishing a strongly connected network. Betweenness centrality of a node well captures its connecting capability. We suggest some new betweenness centrality measures which could
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::690de34e96d2e6bcc5a4164d6a35f1db
https://doi.org/10.1504/ijds.2019.10022088
https://doi.org/10.1504/ijds.2019.10022088
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783319149738
CALDAM
CALDAM
A median (antimedian) of a profile of vertices on a graph G is a vertex that minimizes (maximizes) the remoteness value, that is, the sum of the distances to the elements in the profile. The median (or antimedian) function has as output the set of me
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d8a787932689c6d0a540cd50ff1f5e4
https://doi.org/10.1007/978-3-319-14974-5_14
https://doi.org/10.1007/978-3-319-14974-5_14