Results 91 to 100 of about 6,572,416 (223)
Attachment Centrality for Weighted Graphs [PDF]
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017 Measuring how central nodes are in terms of connecting a network has recently received increasing attention in the literature. While a few dedicated centrality measures have been proposed, Skibski et al. [2016] showed that the Attachment Centrality is the only one that satisfies certain natural axioms desirable for connectivity.
Jadwiga Sosnowska, Oskar Skibski
openaire +1 more source
A New Method for Centrality Measurement Using Generalized Fuzzy Graphs
Discrete Dynamics in Nature and Society, 2022 The fuzzy graph is the foundation of many actual structures such as networking, picture planning, and so on. Generalized fuzzy graphs (GFG) are ideal for avoiding certain constraints of fuzzy graphs.
R. Dhanalakshmi +5 more
doaj +1 more source
DRAGoM: Classification and Quantification of Noncoding RNA in Metagenomic Data
Frontiers in Genetics, 2021 Noncoding RNAs (ncRNAs) play important regulatory and functional roles in microorganisms, such as regulation of gene expression, signaling, protein synthesis, and RNA processing. Hence, their classification and quantification are central tasks toward the
Ben Liu +6 more
doaj +1 more source
Virasoro Representations on Fusion Graphs
, 1992 For any non-unitary model with central charge c(2,q) the path spaces associated to a certain fusion graph are isomorphic to the irreducible Virasoro highest weight modules.Comment: 9 pages (2 Figures not included), Bonn-HE-92 ...
Andreas Recknagel +33 more
core +2 more sources
Topic scene graphs for image captioning
IET Computer Vision, 2022 When describing an image, people can rapidly extract the topic from the image and find the main object, generating sentences that match the main idea of the image. However, most of the scene graph generation methods do not emphasise the importance of the
Min Zhang +4 more
doaj +1 more source
Closeness Centralities of Lollipop Graphs
The Computer Journal, 2023 Abstract Closeness is one of the most studied characteristics of networks. Residual closeness is a very sensitive measure of graphs robustness. Additional closeness is a measure of growth potentials of networks. In this article, we calculate the closeness, vertex residual closeness, link residual closeness and additional closeness of ...
openaire +2 more sources
Generating facets for the cut polytope of a graph by triangular elimination [PDF]
, 2006 The cut polytope of a graph arises in many fields. Although much is known about facets of the cut polytope of the complete graph, very little is known for general graphs. The study of Bell inequalities in quantum information science requires knowledge of
Avis, David +2 more
core +2 more sources
On decay centrality in graphs [PDF]
MATHEMATICA SCANDINAVICA, 2018 The decay centrality of a vertex $v$ in a graph $G$ with respect to a parameter $\delta \in (0,1)$ is a polynomial in δ such that for fixed $k$ the coefficient of $\delta ^k$ is equal to the number of vertices of $G$ at distance $k$ from $v$. This invariant (introduced independently by Jackson and Wolinsky in 1996 and Dangalchev in 2011) is considered ...
Coronicová Hurajová, Jana +2 more
openaire +4 more sources
Dominator Coloring of Central Graphs
International Journal of Computer Applications, 2012 Dominator chromatic number of central graph of various graph families such as cycles, paths, wheel graphs, complete graphs and complete bipartite graphs are found in this paper. Also these parameters are compared with dominator chromatic number of their respective graph families.
N. G. David, K. Kavitha
openaire +1 more source
Towards Psychometrics-based Friend Recommendations in Social Networking Services
, 2017 Two of the defining elements of Social Networking Services are the social profile, containing information about the user, and the social graph, containing information about the connections between users.
Beierle, Felix +3 more
core +1 more source