matrix of a graph.
Clique Matrix of a Graph in Traffic Control Problems
... In the clique matrix a row with all the entries one represents a strongly connected node and it form cliques with all other vertices of the graph. Here in this example the vertex is compatible with all ...
5
Matrix Representation of Double Layered Fuzzy Graph and its Properties
... The concept of fuzzy set was introduced by Zadeh in 1965. Fuzzy graph theory was introduced by Rosenfeld in 1975 [5]. It is well known that matrices play a major role in various areas such as mathematics, physics, ...
8
LAPLACIAN MATRIX IN ALGEBRAIC GRAPH THEORY
... Laplacian matrix and basis sets of symmetric ...in graph structure can be ...mean graph and its modes of variation reconstructed by inverting the system of equations associated with the symmetric ...
12
Graph Regularized Non-negative Matrix Factorization By Maximizing Correntropy
... distance [25], gradient descent-constrained least squares (GS) [24], Projected Gradient NMF (PG) [39], GRNMF and MCC NMF. To make a fair comparison, the initial values of H and W are the same for all algorithms at each ...
10
On graph differential equations and its associated matrix differential equations
... a graph which is isomorphic to its adjacency matrix, the study of analysis of networks involving rate of change with respect to time reduces to the study of graph differential equations or ...
9
Block Matrix Representation of a Graph Manifold Linking Matrix Using Continued Fractions
... 3-dimensional graph manifolds associated with a special type of tree ...these graph manifolds coincide with the reduced matrices obtained from the Laplacian block matrices by means of Gauss partial di- ...
10
On eigenvalue inequalities of a matrix whose graph is bipartite
... symmetric matrix with zero diagonal whose underlying graph is bipartite, and then we show that the odd-indexed eigenvalues of the initial matrix interlace the even-indexed eigenvalues of its ...
12
Matrix Completion for Graph-Based Deep Semi-Supervised Learning
... makes graph construction step unpractical specially for the large scale ...the graph construction step more efficient, and also feasible for online computation and simultaneous with CNN training; because in ...
8
Knowledge Graph Embedding via Dynamic Mapping Matrix
... Our contributions in this paper are: (1)We pro- pose a novel model TransD, which constructs a dynamic mapping matrix for each entity-relation pair by considering the diversity of entities and re- lations ...
10
Vol 7, No 8 (2016)
... A graph πΊπΊ with vertex set ππ (πΊπΊ) is called a Hamming graph if each vertex π£π£ β ππ (πΊπΊ) can be labeled by a string π π (π£π£) of a fixed length such that π»π» ππ οΏ½π π (π’π’), π π (π£π£)οΏ½ = ππ πΊπΊ (π’π’, π£π£) for all π’π’, π£π£ ...
6
On marker set distance Laplacian eigenvalues in graphs.
... on matrix manipulations. Graph spectral methods are widely used in non-bonded clusters in protein structures [17], ...adjacency matrix. In fact, the second smallest eigenvalue of the Laplacian ...
6
Vertex Distance Complement Spectra of Some Graphs
... undirected graph on n vertices. The adjacency matrix of G denoted by A(G) = (a ij ) nΓn is an n Γ n symmetric matrix indexed by the vertices {v 1 , v 2 , ...A graph is regular if every vertex ...
12
A Survey on Energy of Graphs
... simple graph with n vertices and m edges. The ordinary energy of the graph is defined as the sum of the absolute values of the Eigen values of its adjacency matrix ....This graph invariant is ...
9
Vol 8, No 10 (2017)
... In the study of spectral graph theory, we use the spectra of certain matrix associated with the graph, such as the adjacency matrix, the Laplacian matrix and other related matrices. S[r] ...
7
Thesis
... The graph we use is the same as the graph used in previous simulations, and it is a relatively small graph with N = 112 vertices and M = 425 ...adjacency matrix is only an approximation of the ...
29
Vol 11, No 8 (2020)
... energy graph in generalization for Laplacian energy and ...sediel matrix and extended the concept of energy to Hermite ...and graph energy investigates that Seidel switching changes the spectrum, but ...
5
Energy of Complete Fuzzy Labeling Graph through Fuzzy Complete Matching
... labeling graph is introduced. A graph is said to be a complete fuzzy labeling graph if it has every pair of adjacent vertices of the fuzzy ...adjacency matrix of complete fuzzy labeling ...
6
The Bounds for Eigenvalues of Normalized Laplacian Matrices and Signless Laplacian Matrices
... In this paper, we found extreme eigenvalues of normalized Laplacian matrix and signless Laplacian matrix of a G graph with using theirs traces... Conjugate transpose of A denoted by Aβ.[r] ...
5
The deformed graph Laplacian and its applications to network centrality analysis
... of matrix function ...a matrix polynomial representation, leading to an efficient computational ...this matrix polyno- mial, giving further insight into the ...
33
Misbalance degree matrix and related energy of graphs
... adjacency matrix, called MD matrix, corresponding to Misbalance degree index of a graph are ...MD matrix, the concepts MD energy and MD estrada index are ...new graph invariants. The ...
12