Results 11 to 20 of about 2,956,415 (357)
On the Displacement of Eigenvalues When Removing a Twin Vertex [PDF]
Discussiones Mathematicae Graph Theory, 2020 Twin vertices of a graph have the same open neighbourhood. If they are not adjacent, then they are called duplicates and contribute the eigenvalue zero to the adjacency matrix.
Briffa Johann A., Sciriha Irene
doaj +3 more sources
General Zagreb adjacency matrix [PDF]
Contributions to Mathematics, 2022 Zhen Lin
doaj +2 more sources
The $k$-adjacency operators and adjacency Jacobi matrix on distance-regular graphs [PDF]
Boletín de la Sociedad Matemática Mexicana, 2019 We deal in this work with a class of graphs, namely, the class of distance-regular graphs, in which on the basis of $k$-adjacency operators, the adjacency operator $A$ of a distance-regular graph is identified as a Jacobi matrix. To get so, the set of the $k$-adjacency operators is recognized as a canonical basis in a certain Hilbert space, where the ...
Josué I. Rios-Cangas
openalex +3 more sources
A new algorithm to find fuzzy Hamilton cycle in a fuzzy network using adjacency matrix and minimum vertex degree. [PDF]
Springerplus, 2016 A Hamiltonian cycle in a graph is a cycle that visits each node/vertex exactly once. A graph containing a Hamiltonian cycle is called a Hamiltonian graph.
Nagoor Gani A, Latha SR.
europepmc +2 more sources
Fuzzy Adjacency Matrix In Graphs
, 2011 In this paper a new definition of adjacency matrix in the simple graphs is presented that is called fuzzy adjacency matrix, so that elements of it are in the form of 0 and n N n 1 , ∈ that are in the interval [0, 1], and then some charactristics of this matrix are presented with the related examples .
Taheri, Mehrana
openalex +2 more sources
Generating Adjacency Matrix for Video Relocalization [PDF]
, 2020 In this paper, we continue our work on video relocalization task. Based on using graph convolution to extract intra-video and inter-video frame features, we improve the method by using similarity-metric based graph convolution, whose weighted adjacency matrix is achieved by calculating similarity metric between features of any two different time steps ...
Yuan Zhou +3 more
openalex +3 more sources
The anti-adjacency matrix of a graph: Eccentricity matrix
Discrete Applied Mathematics, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Jianfeng +3 more
openaire +4 more sources
Unified Spectral Bounds on the Chromatic Number
Discussiones Mathematicae Graph Theory, 2015 One of the best known results in spectral graph theory is the following lower bound on the chromatic number due to Alan Hoffman, where μ1 and μn are respectively the maximum and minimum eigenvalues of the adjacency matrix: χ ≥ 1+μ1/−μn.
Elphick Clive, Wocjan Pawel
doaj +3 more sources
Adjacency Matrix of a Semigraph
Electronic Notes in Discrete Mathematics, 2017 Abstract Semigraph was defined by Sampathkumar as a generalization of a graph. In this paper the adjacency matrix which represents semigraph uniquely and a characterization of such a matrix is obtained. An algorithm to construct the semigraph from a given square matrix, if semigraphical is given.
Y.S. Gaidhani +2 more
openaire +2 more sources