Establishes equivalence between strong Gram congruence and (weak Gram congruence + same Coxeter polynomial) for connected non-negative unit forms of type A_r, completing their classification.
Matrices in the Theory of Signed Simple Graphs
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
abstract
I discuss the work of many authors on various matrices used to study signed graphs, concentrating on adjacency and incidence matrices and the closely related topics of Kirchhoff (`Laplacian') matrices, line graphs, and very strong regularity.
verdicts
UNVERDICTED 2representative citing papers
A closed-loop opinion-dynamic model on conflict and belief signed networks produces collision-free crossing orders and faster exit times than FCFS at unsignalized intersections.
citing papers explorer
-
A strong Gram classification of non-negative unit forms of Dynkin type A
Establishes equivalence between strong Gram congruence and (weak Gram congruence + same Coxeter polynomial) for connected non-negative unit forms of type A_r, completing their classification.
-
Decentralized Opinion-Integrated Decision making at Unsignalized Intersections via Signed Networks
A closed-loop opinion-dynamic model on conflict and belief signed networks produces collision-free crossing orders and faster exit times than FCFS at unsignalized intersections.