Parsons graphs of matrices
نویسندگان
چکیده
منابع مشابه
On the Connectivity of Parsons Graphs
This paper proves that every Parsons graph Tb(d, q) is connected except for T1(2, 2) and T2(2, 3), and the graph Tb(d, q) has a 1-factor except for T1(2, 2).
متن کاملF-Permutations induce Some Graphs and Matrices
In this paper, by using the notion of fuzzy subsets, the concept of F-permutation is introduced. Then by applying this notion the concepts of presentation of an F-polygroup, graph of an F-permutation and F-permutation matrices are investigated.
متن کاملdeterminants of adjacency matrices of graphs
we study the set of all determinants of adjacency matrices of graphs with a given number of vertices. using brendan mckay's data base of small graphs, determinants of graphs with at most $9$ vertices are computed so that the number of non-isomorphic graphs with given vertices whose determinants are all equal to a number is exhibited in a table. using an idea of m. newman, it is proved that if $...
متن کاملGraphs of unitary matrices
The support of a matrix M is the (0, 1)-matrix with ij-th entry equal to 1 if the ij-th entry of M is non-zero, and equal to 0, otherwise. The digraph whose adjacency matrix is the support of M is said to be the digraph of M . This paper observes some structural properties of digraphs and Cayley digraphs, of unitary matrices. We prove that a group generated by two elements has a set of generato...
متن کاملGraphs, Vectors, and Matrices
This survey accompanies the Josiah Williard Gibbs Lecture that I gave at the 2016 Joint Mathematics Meetings. It provides an introduction to three topics: algebraic and spectral graph theory, the sparsification of graphs, and the recent resolution of the Kadison–Singer Problem. The first and third are connected by the second.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1989
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90176-3