Results 61 to 70 of about 28,893 (164)

The Adjacency Matrix of One Type of Directed Graph and the Jacobsthal Numbers and Their Determinantal Representation

Journal of Applied Mathematics, 2012
Recently there is huge interest in graph theory and intensive study on computing integer powers of matrices. In this paper, we consider one type of directed graph. Then we obtain a general form of the adjacency matrices of the graph.
Fatih Yılmaz, Durmuş Bozkurt
doaj   +1 more source

Non-Compatible Action Graph and Its Adjacency Matrix for The Non-abelian Tensor Product for Groups of Prime Power Order

Wasit Journal of Computer and Mathematics Science
This article focused on the notion of the non-abelian tensor product of groups of prime power order. Particularly, it presented new graph named as Non-compatible action graph and discussed some of its properties. Moreover, this graph concentrated on the
mohd Shahoodh
doaj   +1 more source

Energy of a semigraph

AKCE International Journal of Graphs and Combinatorics, 2019
Semigraph is a generalization of graph. We introduce the concept of energy in a semigraph in two ways, one, the matrix energy , as summation of singular values of the adjacency matrix of a semigraph, and the other, polynomial energy , as energy of the ...
Gaidhani Y.S., Deshpande C.M., Pirzada S.   +2 more
doaj   +1 more source

Degree based energy and spectral radius of a graph with self-loops

AKCE International Journal of Graphs and Combinatorics
Let GX be a graph obtained from a simple graph G by attaching a self-loop at each vertex of [Formula: see text]. The general extended adjacency matrix for the graph GX is defined and the bounds for the degree based energy of the graph GX are obtained ...
Shashwath S. Shetty, Arathi Bhat K
doaj   +1 more source

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   +1 more source

Spectra of Graphs Resulting from Various Graph Operations and Products: a Survey

Special Matrices, 2018
Let G be a graph on n vertices and A(G), L(G), and |L|(G) be the adjacency matrix, Laplacian matrix and signless Laplacian matrix of G, respectively. The paper is essentially a survey of known results about the spectra of the adjacency, Laplacian and ...
Barik S., Kalita D., Pati S., Sahoo G.
doaj   +1 more source

𝕮-inverse of graphs and mixed graphs

Open Mathematics
This article introduces a generalization of the concept of inverse graphs applicable to both graphs and mixed graphs. Given a graph GG with adjacency matrix A(G)A\left(G), the inverse graph G−1{G}^{-1} is defined such that its adjacency matrix is similar
Alomari Omar, Abudayah Mohammad, Ghanem Manal   +2 more
doaj   +1 more source

Bounds for the Energy of Hypergraphs

Axioms
The concept of the energy of a graph has been widely explored in the field of mathematical chemistry and is defined as the sum of the absolute values of the eigenvalues of its adjacency matrix.
Liya Jess Kurian, Chithra Velu
doaj   +1 more source

RAM-PGK: Prediction of Lysine Phosphoglycerylation Based on Residue Adjacency Matrix. [PDF]

Genes (Basel), 2020
Chandra AA, Sharma A, Dehzangi A, Tsunoda T.   +3 more
europepmc   +1 more source

The Maximum Eigenvalue of the Brain Functional Network Adjacency Matrix: Meaning and Application in Mental Fatigue Evaluation. [PDF]

Brain Sci, 2020
Li G, Jiang Y, Jiao W, Xu W, Huang S, Gao Z, Zhang J, Wang C.   +7 more
europepmc   +1 more source