Results 61 to 70 of about 1,167,245 (202)

Finding Optimal Routings in Hamming Graphs

European Journal of Combinatorics, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Khoon Lim, Tian, Praeger, Cheryl E.
openaire   +1 more source

Entanglement of free fermions on Hamming graphs

Nuclear Physics B, 2023
25 ...
Bernard, Pierre-Antoine, Crampé, Nicolas, Vinet, Luc   +2 more
openaire   +3 more sources

Weighted Szeged indices of some graph operations [PDF]

Transactions on Combinatorics, 2016
In this paper, the weighted Szeged indices of Cartesian product and Corona product of twoconnected graphs are obtained. Using the results obtained here, the weighted Szeged indices ofthe hypercube of dimension n, Hamming graph, C4 nanotubes, nanotorus ...
Kannan Pattabiraman, P. Kandan
doaj  

Betweenness centrality in Cartesian product of graphs

AKCE International Journal of Graphs and Combinatorics, 2020
Betweenness centrality is a widely used measure in various graphs and it has a pivotal role in the analysis of complex networks. It measures the potential or power of a node to control the communication over the network.
Sunil Kumar R., Kannan Balakrishnan
doaj   +1 more source

Bayesian Network Structure Learning Approach Based on Searching Local Structure of Strongly Connected Components

IEEE Access, 2022
Learning the structure of Bayesian networks is a challenging problem because it is a NP-Hard problem. As an excellent search & score based method, the K2 algorithm strongly depends on the input of global order of all nodes to ensure the result is ...
Kunhua Zhong, Yuwen Chen, Ju Zhang, Xiaolin Qin   +3 more
doaj   +1 more source

On the Independence Graph of Hamming Graph

Iranian Journal of Mathematical Sciences and Informatics
Summary: The independence graph \(\operatorname{Ind}(G)\) of a graph \(G\) is the graph with vertices as maximum independent sets of \(G\) and two vertices are adjacent, if and only if the corresponding maximum independent sets are disjoint. In this work, we find the independence graph of Cartesian product of \(d\) copies of complete graphs \(K_q ...
Saravanan, M., Kathiresan, KM.
openaire   +2 more sources

Object-Level Visual-Text Correlation Graph Hashing for Unsupervised Cross-Modal Retrieval

Sensors, 2022
The core of cross-modal hashing methods is to map high dimensional features into binary hash codes, which can then efficiently utilize the Hamming distance metric to enhance retrieval efficiency.
Ge Shi, Feng Li, Lifang Wu, Yukun Chen
doaj   +1 more source

Unveiling Internet Streaming Services: A Comparison Using Neutrosophic Graphs

Fuzzy Information and Engineering
This paper investigates the inverse of the maximum result obtained by multiplying two unique graph types known as neutrosophic graphs. The main goal is to comprehend a point’s degree in the opposite situation of a neutrosophic graph’s maximum product ...
M. Kaviyarasu
doaj   +1 more source

Minimal residual ordinal loss hashing with an adaptive optimization mechanism

EURASIP Journal on Image and Video Processing, 2020
The binary coding technique has been widely used in approximate nearest neighbors (ANN) search tasks. Traditional hashing algorithms treat binary bits equally, which usually causes an ambiguous ranking.
Zhen Wang, Fuzhen Sun, Longbo Zhang, Pingping Liu   +3 more
doaj   +1 more source

Generalized Hamming graphs: some new results

Discussiones Mathematicae Graph Theory, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bedrane Amari, Abdelhafid Berrachedi
openaire   +2 more sources