Zobrazeno 1 - 10
of 36
pro vyhledávání: '"Universal adjacency matrix"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Linear Algebra and Its Applications 1 September 2022 648:160-180
Autor:
Saraswati Bajaj, Pratima Panigrahi
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 0, Iss 0, Pp 1-17 (2021)
For a commutative ring R with unity, the zero divisor graph is an undirected graph with all non-zero zero divisors of R as vertices and two distinct vertices u and v are adjacent if and only if uv = 0. For a simple graph G with the adjacency matrix A
Externí odkaz:
https://doaj.org/article/0a6a157b0f6e4d7ca92c056d2e9950f8
Publikováno v:
In Linear Algebra and Its Applications 15 September 2021 625:20-43
Autor:
Haemers, Willem H. a, ⁎, Oboudi, Mohammad Reza b
Publikováno v:
In Linear Algebra and Its Applications 1 December 2020 606:244-248
Publikováno v:
Linear Algebra and its Applications. 648:160-180
The H-join of a family of graphs $\mathcal{G}$={G_1, \dots, G_p}, also called generalized composition, H[G_1, \dots, G_p], where all graphs are undirected, simple and finite, is the graph obtained by replacing each vertex i of H by G_i and adding to
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Linear Multilinear Algebra
Universitat Politècnica de Catalunya (UPC)
Linear Multilinear Algebra
The universal adjacency matrix U of a graph Γ, with adjacency matrix A, is a linear combination of A, the diagonal matrix D of vertex degrees, the identity matrix I, and the all-1 matrix J with real coefficients, that is, U=c1A+c2D+c3I+c4J, with ci
Autor:
Pratima Panigrahi, Saraswati Bajaj
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 0, Iss 0, Pp 1-17 (2021)
For a commutative ring R with unity, the zero divisor graph is an undirected graph with all non-zero zero divisors of R as vertices and two distinct vertices u and v are adjacent if and only if uv = 0. For a simple graph G with the adjacency matrix A
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Ahmadi, B. a, Alinaghipour, F. a, Fallat, Shaun M. a, Fan, Yi-Zheng b, Meagher, K. a, Nasserasr, S. a, ⁎
Publikováno v:
In Linear Algebra and Its Applications 15 October 2012 437(8):2064-2076