Result: On unimodular graphs
Title:
On unimodular graphs
Authors:
Source:
12th ILAS ConferenceLinear algebra and its applications. 421(1):3-15
Publisher Information:
New York, NY: Elsevier Science, 2007.
Publication Year:
2007
Physical Description:
print, 13 ref
Original Material:
INIST-CNRS
Subject Terms:
Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Combinatoire. Structures ordonnées, Combinatorics. Ordered structures, Combinatoire, Combinatorics, Théorie des graphes, Graph theory, Algèbre, Algebra, Algèbre linéaire et multilinéaire, matrices, Linear and multilinear algebra, matrix theory, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Recherche information. Graphe, Information retrieval. Graph, Déterminant, Determinant, Determinante, Fonction matricielle, Matrix function, Función matricial, Forêt, Forests, Bosque, Graphe biparti, Bipartite graph, Grafo bipartido, Inversion matrice, Matrix inversion, Inversión matriz, Matrice adjacence, Adjacency matrix, Matriz adyacencia, Matrice non négative, Non negative matrix, Matriz no negativa, Matrice unimodulaire, Unimodular matrix, Matriz unimodular, Mineur, Minor, Minero, Problème combinatoire, Combinatorial problem, Problema combinatorio, Théorie graphe, Graph theory, Teoría grafo, Graphe unicyclique, Unicyclic graph, Grafo unicíclico, 05C05; 05C50; 15A09; 15A15, Determinant; Minor; Forest; Unicyclic graph; Unimodular graph
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Mathematical Sciences, Sharif University of Technology, P.O. Box 11365-9415, Tehran, Iran, Islamic Republic of
Department of Mathematics and Statistics, University of Regina, Regina, Saskatchewan, S4S OA2, Canada
Department of Mathematics and Statistics, University of Regina, Regina, Saskatchewan, S4S OA2, Canada
ISSN:
0024-3795
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Mathematics
Mathematics
Accession Number:
edscal.18700908
Database:
PASCAL Archive
Further Information
We study graphs whose adjacency matrices have determinant equal to 1 or -1, and characterize certain subclasses of these graphs. Graphs whose adjacency matrices are totally unimodular are also characterized. For bipartite graphs having a unique perfect matching, we provide a formula for the inverse of the corresponding adjacency matrix, and address the problem of when that inverse is diagonally similar to a non-negative matrix. Special attention is paid to the case that such a graph is unicyclic.