Results 21 to 30 of about 547,023 (266)
On the distance eigenvalues of Cayley graphs
پژوهشهای ریاضی, 2022 In this paper, graphs are undirected and loop-free and groups are finite. By Cn, Kn and Km,n we mean the cycle graph with n vertices, the complete graph with n vertices and the complete bipartite graph with parts size m and n, respectively.
Majid Arezoomand
doaj
Determining finite connected graphs along the quadratic embedding constants of paths
Electronic Journal of Graph Theory and Applications, 2021 The QE constant of a finite connected graph G, denoted by QEC(G), is by definition the maximum of the quadratic function associated to the distance matrix on a certain sphere of codimension two.
Edy Tri Baskoro, Nobuaki Obata
doaj +1 more source
The bipartite Laplacian matrix of a nonsingular tree
Special Matrices, 2023 For a bipartite graph, the complete adjacency matrix is not necessary to display its adjacency information. In 1985, Godsil used a smaller size matrix to represent this, known as the bipartite adjacency matrix.
Bapat Ravindra B. +2 more
doaj +1 more source
Distance spectrum and energy in single valued neutrosophic graphs [PDF]
Neutrosophic Sets and SystemsThis study introduces the concept of distance matrix and distance energy in the context of single valued neutrosophic graphs (SVNGs), which extend classical graph theory by incorporating uncertainty and indeterminacy through neutrosophic sets.
A. S. Sasipriya, Lakshmi Madireddy
doaj +1 more source
Information Mandala: Statistical Distance Matrix with Clustering [PDF]
IEEE Access, 2021 <p>In machine learning, observation features are measured in a metric space to obtain their distance function for optimization. Given similar features that are statistically sufficient as a population, a statistical distance between two probability distributions can be calculated for more precise learning. Provided the observed features are multi-
openaire +5 more sources
Proceedings of the International Conference on Applied Innovations in IT, 2018 The process automation is one of the effective approaches to process management based on the use of information technology at the present stage of the society development.
Julia Dubrovskaya +3 more
doaj +1 more source
Distance Matrix of a Class of Completely Positive Graphs: Determinant and Inverse
Special Matrices, 2020 A real symmetric matrix A is said to be completely positive if it can be written as BBt for some (not necessarily square) nonnegative matrix B. A simple graph G is called a completely positive graph if every matrix realization of G that is both ...
Das Joyentanuj +2 more
doaj +1 more source
Cell wall target fragment discovery using a low‐cost, minimal fragment library
FEBS Letters, EarlyView.LoCoFrag100 is a fragment library made up of 100 different compounds. Similarity between the fragments is minimized and 10 different fragments are mixed into a single cocktail, which is soaked to protein crystals. These crystals are analysed by X‐ray crystallography, revealing the binding modes of the bound fragment ligands.
Kaizhou Yan +5 more
wiley +1 more source
Mathematics, 2021 Let G be a graph of order n. If the maximal connected subgraph of G has no cut vertex then it is called a block. If each block of graph G is a clique then G is called clique tree.
Shaowei Sun +2 more
doaj +1 more source
Molecular Oncology, EarlyView.A comprehensive genomic and proteomic analysis of cervical cancer revealed STK11 and STX3 as a potential biomarkers of chemoradiation resistance. Our study demonstrated EGFR as a therapeutic target, paving the way for precision strategies to overcome treatment failure and the DNA repair pathway as a critical mechanism of resistance.
Janani Sambath +13 more
wiley +1 more source