• No results found

graph of a matrix

Matrix Representation of Double Layered Fuzzy Graph and its Properties

Matrix Representation of Double Layered Fuzzy Graph and its Properties

... usual matrix representation of a fuzzy graph with respect to vertices, a new matrix representation with edge membership values as rows and columns is ...fuzzy graph and the given fuzzy ...

8

LAPLACIAN MATRIX IN ALGEBRAIC GRAPH THEORY

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

Graph Regularized Non-negative Matrix Factorization By Maximizing Correntropy

... Leibler (KL) divergence. However, nonlinear cases are not properly handled when we use these error measures. As a consequence, alternative measures based on nonlinear kernels, such as correntropy, are proposed. However, ...

10

Block Matrix Representation of a Graph  Manifold Linking Matrix Using  Continued Fractions

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

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

Clique Matrix of a Graph in Traffic Control Problems

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

On graph differential equations and its associated matrix differential equations

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

Matrix Completion for Graph-Based Deep Semi-Supervised Learning

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

Knowledge Graph Embedding via Dynamic Mapping Matrix

... (3) Matrix-vector multiplication makes it has large amount of calculation, and when relation number is large, it also has much more param- eters than TransE and ...

10

A Survey on Energy of Graphs

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

Vertex Distance Complement Spectra of Some Graphs

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

Vol 8, No 10 (2017)

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

Vol 7, No 8 (2016)

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

Thesis

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)

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

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

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

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

Matrix Representations of Intuitionistic Fuzzy Graphs

Matrix Representations of Intuitionistic Fuzzy Graphs

... Definition 2.2 [8]Let G βˆ— = (V, E) be a crisp graph. A walk is a sequence of vertices and edges, where the endpoints of each edge are the preceding and following vertices in the sequence. A path is a walk without ...

18

Misbalance degree matrix and related energy of graphs

Misbalance degree matrix and related energy of graphs

... regular graph. A subdivision graph of G is a graph S(G) obtained from G by inserting a new vertex on each edge of ...vertex graph of G, denoted by R(G), is a graph with vertex set V (G) ...

12

Show all 10000 documents...

Related subjects