The singularity/nonsingularity problem for matrices satisfying diagonal dominance conditions formulated in terms of directed graphs.

Kolotilina, L.Yu.

Displaying similar documents to “The singularity/nonsingularity problem for matrices satisfying diagonal dominance conditions formulated in terms of directed graphs.”

On composition of signed graphs

K. Shahul Hameed, K.A. Germina (2012)

Discussiones Mathematicae Graph Theory

Similarity:

A graph whose edges are labeled either as positive or negative is called a signed graph. In this article, we extend the notion of composition of (unsigned) graphs (also called lexicographic product) to signed graphs. We employ Kronecker product of matrices to express the adjacency matrix of this product of two signed graphs and hence find its eigenvalues when the second graph under composition is net-regular. A signed graph is said to be net-regular if every vertex has constant net-degree,...

Discussing graph theory with a computer. II: Theorems suggested by the computer.

Cvetkovic, Dragos M. (1983)

Publications de l'Institut Mathématique. Nouvelle Série

Similarity:

On the numbers of positive and negative eigenvalues of a graph.

Torgašev, Aleksandar (1992)

Publications de l'Institut Mathématique. Nouvelle Série

Similarity:

Some results on graphs with at most two positive eigenvalues.

Petrović, Miroslav (1991)

Publications de l'Institut Mathématique. Nouvelle Série

Similarity:

Signless Laplacians and line graphs

D. Cvetković (2005)

Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques

Similarity:

Non-complete extended $P$ -sum of graphs, graph angles and star partitions.

Cvetković, Dragoš, Simić, Slobodan (1993)

Publications de l'Institut Mathématique. Nouvelle Série

Similarity:

Eigenvalues and the max-cut problem

Bojan Mohar, Svatopluk Poljak (1990)

Czechoslovak Mathematical Journal

Similarity:

Permutation of sparse matrices to a specific lower BFT using graph decompositions.

Ponzoni, Ignacio, Sánchez, Mabel C., Brignole, Nélida B. (1998)

Electronic Journal of SADIO [electronic only]

Similarity:

Matrices representable by directed graphs

Zofia Majcher (1985)

Archivum Mathematicum

Similarity:

TOWARDS A SPECTRAL THEORY OF GRAPHS BASED ON THE SIGNLESS LAPLACIAN, I

Dragoš Cvetković, Slobodan K. Simić (2009)

Publications de l'Institut Mathématique

Similarity:

The Least Eigenvalue of Graphs whose Complements Are Uni- cyclic

Yi Wang, Yi-Zheng Fan, Xiao-Xin Li, Fei-Fei Zhang (2015)

Discussiones Mathematicae Graph Theory

Similarity:

A graph in a certain graph class is called minimizing if the least eigenvalue of its adjacency matrix attains the minimum among all graphs in that class. Bell et al. have identified a subclass within the connected graphs of order n and size m in which minimizing graphs belong (the complements of such graphs are either disconnected or contain a clique of size n/2 ). In this paper we discuss the minimizing graphs of a special class of graphs of order n whose complements are connected and...

Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes

Gyula Y. Katona, Morteza Faghani, Ali Reza Ashrafi (2014)

Discussiones Mathematicae Graph Theory

Similarity:

The energy of a molecular graph G is defined as the summation of the absolute values of the eigenvalues of adjacency matrix of a graph G. In this paper, an infinite class of fullerene graphs with 10n vertices, n ≥ 2, is considered. By proving centrosymmetricity of the adjacency matrix of these fullerene graphs, a lower bound for its energy is given. Our method is general and can be extended to other class of fullerene graphs.