Zobrazeno 1 - 10
of 307
pro vyhledávání: '"edge weight"'
Autor:
Akbar Ali, Sneha Sekar, Selvaraj Balachandran, Suresh Elumalai, Abdulaziz M. Alanazi, Taher S. Hassan, Yilun Shang
Publikováno v:
AIMS Mathematics, Vol 9, Iss 11, Pp 32552-32570 (2024)
Consider a tree graph $ G $ with edge set $ E(G) $. The notation $ d_G(x) $ represents the degree of vertex $ x $ in $ G $. Let $ \mathfrak{f} $ be a symmetric real-valued function defined on the Cartesian square of the set of all distinct elements o
Externí odkaz:
https://doaj.org/article/ce79b14be2a6467da55124bcb709b249
Autor:
Sakander Hayat, Sunilkumar M. Hosamani, Asad Khan, Ravishankar L. Hutagi, Umesh S. Mujumdar, Mohammed J. F. Alenazi
Publikováno v:
AIMS Mathematics, Vol 9, Iss 9, Pp 24955-24976 (2024)
Regarding a simple graph $ \Gamma $ possessing $ \nu $ vertices ($ \nu $-vertex graph) and $ m $ edges, the vertex-weight and weight of an edge $ e = uv $ are defined as $ w(v_{i}) = d_{ \Gamma}(v_{i}) $ and $ w(e) = d_{ \Gamma}(u)+d_{ \Gamma}(v)-2 $
Externí odkaz:
https://doaj.org/article/894abb87aa9b43449998fc3cb40f93db
Publikováno v:
IEEE Access, Vol 12, Pp 174017-174027 (2024)
This study presents an innovative approach to hourly demand forecasting for bike-sharing systems using a multi-attribute, edge-weighted, Gated Graph Convolutional Network (GGCN). It addresses the challenge of imbalanced bike borrowing and returning d
Externí odkaz:
https://doaj.org/article/26f47294c0f24c1ca18696fe88682c44
Publikováno v:
Mathematics, Vol 12, Iss 23, p 3658 (2024)
Consider a unicyclic graph G with edge set E(G). Let f be a real-valued symmetric function defined on the Cartesian square of the set of all distinct elements of G’s degree sequence. A graphical edge-weight-function index of G is defined as If(G)=
Externí odkaz:
https://doaj.org/article/d98ebdc702364d018f0b20d2c5261d10
Autor:
V. Sandhiya, M. Nalliah
Publikováno v:
Heliyon, Vol 9, Iss 7, Pp e17761- (2023)
Let G=(V,E) be a graph without isolated vertices and let |V(G)|=n and |E(G)|=m. A bijection π:V(G)∪E(G)→{1,2,....,n+m} is said to be local total anti-magic labeling of a graph G if it satisfies the conditions: (i.) for any edge uv, ω(u)≠ω(v)
Externí odkaz:
https://doaj.org/article/b05d7836163a4f79b166d95f7ad4e2d5
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Jisuanji kexue, Vol 49, Iss 4, Pp 49-55 (2022)
Aiming at the problem of community discovery in relational networks, considering the strength of interaction between nodes and information seepage mechanism, an edge weight and connected component (EWCC) community discovery algorithm based on edge we
Externí odkaz:
https://doaj.org/article/807143a2a27f4c2eaabf93700f4036b0
Autor:
Vasam Manjveekar Prabantu, Vasundhara Gadiyaram, Saraswathi Vishveshwara, Narayanaswamy Srinivasan
Publikováno v:
Current Research in Structural Biology, Vol 4, Iss , Pp 134-145 (2022)
Proteins perform their function by accessing a suitable conformer from the ensemble of available conformations. The conformational diversity of a chosen protein structure can be obtained by experimental methods under different conditions. A key issue
Externí odkaz:
https://doaj.org/article/74aea45c16ad4eaba06795c4df258f35
Autor:
Baris Taner, Kamesh Subbarao
Publikováno v:
Franklin Open, Vol 2, Iss , Pp 100014- (2023)
This work implements a non-linear programming method to synthesize edge weights of an adjacency matrix for a linear parameter varying multi-agent system using bilinear matrix inequalities, which suffer uncertainties. First, convex–concave decomposi
Externí odkaz:
https://doaj.org/article/2424475937274448947c44d993b2380a
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.