✦ LIBER ✦

Signature matrix algebras and bipartite graphs

✍ Scribed by Aguirre Holguín, Valeria; Wojciechowski, Piotr J.

Book ID: 122113958
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 239 KB
Volume: 451
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2014.03.016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Matrix graphs and bipartite graphs

✍ Wai-kai Chen 📂 Article 📅 1965 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 262 KB

Bipartite Graphs Whose Edge Algebras Are

Bipartite Graphs Whose Edge Algebras Are Complete Intersections

✍ Mordechai Katzman 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 115 KB

Let R be a monomial subalgebra of k x 1 x N generated by square free monomials of degree two. This paper addresses the following question: when is R a complete intersection? For such a k-algebra we can associate a graph G whose vertices are x 1 x N and whose edges are x i x j x i x j ∈ R . Convers

Commuting Graphs of Matrix Algebras

✍ Akbari, S.; Bidkhori, H.; Mohammadian, A. 📂 Article 📅 2008 🏛 Taylor and Francis Group 🌐 English ⚖ 202 KB

Algebraic characterizations of regularit

Algebraic characterizations of regularity properties in bipartite graphs

✍ Abiad, Aida; Dalfó, Cristina; Fiol, Miquel Àngel 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 407 KB

Bipartite Graphs, Hamiltonicity and grap

Bipartite Graphs, Hamiltonicity and graphs

✍ Rahman, M. Sohel; Kaykobad, M.; Kaykobad, Md. Tanvir 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 182 KB

Permanent of the Laplacian matrix of tre

Permanent of the Laplacian matrix of trees and bipartite graphs

✍ Richard A Brualdi; John L Goldwasser 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 805 KB

be the Laplacian matrix of G. When G is a tree or a bipartite graph we obtain bounds for the permanent of L(G) both in terms of n only and in terms of d 1 ..... d,. Improved bounds are obtained in terms of the diameter of T and the size of a matching in T.