Results 111 to 120 of about 2,418,413 (302)

Spectral Characterization of the Hamming Graphs [PDF]

We show that the Hamming graph H(3; q) with diameter three is uniquely determined by its spectrum for q ¸ 36. Moreover, we show that for given integer D ¸ 2, any graph cospectral with the Hamming graph H(D; q) is locally the disjoint union of D copies of
Koolen, J.H., Bang, S., Dam, E.R. van
core  

Structural Relationship of Isomorphic Graph and its Mapping to Hamming Distance [PDF]

EPJ Web of Conferences
Mapping graph isomorphism to Hamming distance enables a simple yet effective approach to quantifying structural similarity. By encoding graphs as binary adjacency vectors—flattened from the upper triangle of the adjacency matrix—structural comparisons ...
Tiwari Monika, Patel Priyanka, Katare Rakesh Kumar, Katare Charvi   +3 more
doaj   +1 more source

Mean distance in a graph

Discrete Mathematics, 1977
AbstractThe average or mean of the distances between vertices in a connected graph Γ, μ(Γ), is a natural measure of the compactness of the graph. In this paper we compute bounds for μ(Γ) in terms of the number of vertices in Γ and the diameter of Γ. We prove a formula for computing μ(Γ) when Γ is a tree which is particularly useful when Γ has a high ...
J. K. Doyle, Jack E. Graver
openaire   +3 more sources

Evaluating the effect of γ‐oryzanol on MASLD pathology using a medaka fish model

FEBS Open Bio, EarlyView.
This study explores a liver disease called MASLD, which is increasing worldwide and can lead to serious damage. Researchers used medaka fish instead of rodents to test a food compound, γ‐oryzanol. Fish fed this compound had less liver fat and healthier gut bacteria.
Yukako Ito, Haduki Asano, Ayano Ueki, Joe Sakamoto, Yasuhiro Kamei, Hayato Tokumoto, Ayaka Yazawa, Shigeki Kamitani   +7 more
wiley   +1 more source

In silico and in vitro exploration of a tyrosinase for biocatalytic production of catechols

FEBS Open Bio, EarlyView.
Tyrosinase from Ralstonia pseudosolanacearum is a promising biocatalyst for producing valuable catechols from monophenol substrates. This tyrosinase is uniquely suited to this due to its high monophenolase : diphenolase ratio. We combined in silico docking and in vivo kinetic characterisation of this tyrosinase with 11 industrially relevant monophenols,
James Britton, Fang Zhao, Reeta Davis, Meg Walsh, Kevin E O'Connor, David O'Connell, Tanja Narancic   +6 more
wiley   +1 more source

Improved Density Peaks Clustering Based on Shared-Neighbors of Local Cores for Manifold Data Sets

IEEE Access, 2019
A novel clustering algorithm by fast search and find of density peaks (DP) was proposed in Science, 2014. It has attracted much attention from researchers. It can easily select clusters centers with decision graph.
Dongdong Cheng, Jinlong Huang, Sulan Zhang, Huijun Liu   +3 more
doaj   +1 more source

Heterotropic regulation and negative homotropic cooperativity

FEBS Open Bio, EarlyView.
We identified a structural module common to some proteins that couple negative cooperativity with heterotropic regulation, two features that rarely coexist. These proteins are ring‐like and present an ordered asymmetry whereby noncontacting subunits are symmetric, and their tertiary structure differs from that of contacting subunits.
Veronica Morea, Francesco Angelucci, Federica Arnesano, Gianmarco Pascarella, Patrizio Di Micco, Andrea Bellelli   +5 more
wiley   +1 more source

DeepEDD: Nonparametric deep graph clustering through effective distance and density

Deep graph clustering methods have become a prominent area of research. Although nonparametric clustering techniques have clear advantages, current research indicates that nonparametric methods in the field of graph clustering are scarce. Most deep graph
Ma, Yuanchi, He, H, Shi, Kaize, Ma, Y, Lei, Z, Peng, Xueping, Niu, Z, Lei, Zhongxiang, Niu, Zhendong, He, Hui, Shi, K, Peng, X   +11 more
core   +1 more source

On distance Laplacian energy in terms of graph invariants

, 2023
summary:For a simple connected graph $G$ of order $n$ having distance Laplacian eigenvalues $ \rho ^{L}_{1}\geq \rho ^{L}_{2}\geq \cdots \geq \rho ^{L}_{n}$, the distance Laplacian energy ${\rm DLE} (G)$ is defined as ${\rm DLE} (G)=\sum _{i=1}^{n}|\rho ^
Rather, Bilal A., Ul Shaban, Rezwan, Ganie, Hilal A., Pirzada, Shariefuddin   +3 more
core   +1 more source

On the connectivity of $k$-distance graphs

Electronic Journal of Graph Theory and Applications, 2017
For any $k \in \mathbb{N}$, the $k-$distance graph $D^{k}G$ has the same vertex set of $G$, and two vertices of $D^{k}G$ are adjacent if they are exactly distance $k$ apart in the original graph $G$. In this paper, we consider the connectivity of $D^{k}G$
Omid Khormali
doaj   +1 more source