Some properties of a multidigraph by semi-incidence matrices (Q1058523): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new 5‐arc‐transitive cubic graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matrix tree theorems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3907599 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3937445 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5545849 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5786986 / rank | |||
Normal rank |
Latest revision as of 16:45, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Some properties of a multidigraph by semi-incidence matrices |
scientific article |
Statements
Some properties of a multidigraph by semi-incidence matrices (English)
0 references
1985
0 references
Let A be the \(n\times n\) adjacency matrix of a multidigraph G and let \(D^+(D^-)\) be its diagonal outvalence (invalence) matrix. The authors express the matrices A, \(A+D^+\), \(A+D^-\), \(D^+-A\), \(D^--A\) by out- and in-incidence matrices; these relations enable them to determine properties of the above mentioned matrices in a simple way.
0 references
characteristic polynomial
0 references
multidigraph
0 references
0 references