Results 11 to 20 of about 2,949,927 (358)
TRACE OF THE ADJACENCY MATRIX n×n OF THE CYCLE GRAPH TO THE POWER OF TWO TO FIVE
Barekeng, 2022 The main aim of this research is to find the formula of the trace of adjacency matrix from a cycle graph to the power of two to five. To obtain the general form, the first step is finding the general formula of the adjacency matrix from a cycle graph ...
Fitri Aryani +3 more
doaj +3 more sources
Cospectral Graphs and the Generalized Adjacency Matrix [PDF]
SSRN Electronic Journal, 2006 AMS classifications: 05C50; 05E99;cospectral graphs;generalized spectrum;generalized adjacency ...
Dam, E.R. van +2 more
core +11 more sources
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
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
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
A method of calculating the degree of freedom of foldable plate rigid origami with adjacency matrix [PDF]
Advances in Mechanical Engineering, 2018 The mechanism with good fold performance derived from rigid origami is widely used in the field of engineering. In this article, the adjacency matrix method was proposed to analyze the degree of freedom of foldable plate rigid origami.
Hongying Yu, Zhen Guo, Junru Wang
openalex +2 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