Add to ORKGA graph is said positively multiplicative when its adjacency matrix A embeds in a matrix algebra admitting a basis B with nonnegative structure constants in which the matrix multiplication by A coincides with A. The goal of this paper is to present basics on this notion and expose, through various simple examples, how it relates to highly non trivial problems like the combinatorial description of fusion rules, the determination of spectrum in Cayley graphs, the description of the minimal boundary of graded graphs or the study of random walks on alcove tilings
Recently there is huge interest in graph theory and intensive study on computing integer powers of m...
AbstractFor a fixed graph G, the capacity function for G, PG, is defined by PG(H) = limn→∞[γG(Hn)]1/...
AbstractA conjecture of Aanderaa and Rosenberg [15] motivates this work. We investigate the maximum ...
A graph is said positively multiplicative when its adjacency matrix A embeds in a matrix algebra adm...
This book focuses on some of the main notions arising in graph theory, with an emphasis throughout o...
This new edition illustrates the power of linear algebra in the study of graphs. The emphasis on mat...
The present article is designed to be a contribution to the chapter `Combinatorial Matrix Theory and...
For any positive integer k let P<SUB>k</SUB> denote the characteristic polynomial of the adjacency m...
In this article we establish relationships between Leavitt path algebras, talented monoids and the a...
AbstractFor any positive integer k let Pk denote the characteristic polynomial of the adjacency matr...
AbstractA graph K is called multiplicative if whenever a categorical product of two graphs admits a ...
With every graph (or digraph) one can associate several different matrices. Here we shall concentrat...
A graph with p vertices is said to be strongly multiplicative if its vertices can be labelled 1,2,.....
AbstractA partial matrix is a rectangular array, only some of whose entries are specified. The title...
This thesis is expository in nature and is based on selected sections of Chapters 2 and 3 of the boo...
Recently there is huge interest in graph theory and intensive study on computing integer powers of m...
AbstractFor a fixed graph G, the capacity function for G, PG, is defined by PG(H) = limn→∞[γG(Hn)]1/...
AbstractA conjecture of Aanderaa and Rosenberg [15] motivates this work. We investigate the maximum ...
A graph is said positively multiplicative when its adjacency matrix A embeds in a matrix algebra adm...
This book focuses on some of the main notions arising in graph theory, with an emphasis throughout o...
This new edition illustrates the power of linear algebra in the study of graphs. The emphasis on mat...
The present article is designed to be a contribution to the chapter `Combinatorial Matrix Theory and...
For any positive integer k let P<SUB>k</SUB> denote the characteristic polynomial of the adjacency m...
In this article we establish relationships between Leavitt path algebras, talented monoids and the a...
AbstractFor any positive integer k let Pk denote the characteristic polynomial of the adjacency matr...
AbstractA graph K is called multiplicative if whenever a categorical product of two graphs admits a ...
With every graph (or digraph) one can associate several different matrices. Here we shall concentrat...
A graph with p vertices is said to be strongly multiplicative if its vertices can be labelled 1,2,.....
AbstractA partial matrix is a rectangular array, only some of whose entries are specified. The title...
This thesis is expository in nature and is based on selected sections of Chapters 2 and 3 of the boo...
Recently there is huge interest in graph theory and intensive study on computing integer powers of m...
AbstractFor a fixed graph G, the capacity function for G, PG, is defined by PG(H) = limn→∞[γG(Hn)]1/...
AbstractA conjecture of Aanderaa and Rosenberg [15] motivates this work. We investigate the maximum ...