Search

Let G be a simple graph with the adjacency matrix A (G) , and let τ (G) denote the smallest positive eigenvalue of A (G). Let G n be the class of all connected bipartite graphs on n = 2 k vertices with a unique perfect matching. In this article, we characterize the graphs G in G n such that τ (G) does not exceed 1 2. Using the above characterization, we obtain the unique graphs in G n with the maximum and the second maximum τ , respectively. Further, we prove that the largest and the second largest limit points of the smallest positive eigenvalues of bipartite graphs with a unique perfect matching are 1 2 and the reciprocal of α 3 1 2 + α 3 − 1 2 , respectively, where α 3 is the largest root of x 3 − x − 1. [ABSTRACT FROM AUTHOR]

The energy of a graph is defined as the sum of the absolute values of all eigenvalues with respect to its adjacency matrix. Denote by Gn,m the set of all connected graphs having n vertices and m edges. Caporossi et al. [Caporossi G, Cvetkovi D, Gutman I, et al. Variable neighbourhood search for extremal graphs. 2. Finding graphs with external energy. J Chem Inf Comput Sci. 1999;39:984–996] conjectured that among all graphs in Gn,m, n ≥ 6 and n − 1 ≤ m ≤ 2(n − 2), the graphs with minimum energy are the star Sn with m−n + 1 additional edges all connected to the same vertices for m ≤ n + ⌊ (n − 7) / 2 ⌋ , and the bipartite graph with two vertices on one side, one of which is connected to all vertices on the other side, otherwise. In this paper, we provide a new approach to investigate the conjecture above. Especially, we determine the unique tetracyclic graph having minimum energy. [ABSTRACT FROM AUTHOR]

Let G be a simple connected graph and A (G) be the adjacency matrix of G. The graph G is said to have the reciprocal eigenvalue property (R) if A (G) is nonsingular and 1 λ is an eigenvalue of A (G) whenever λ is an eigenvalue of A (G). Further, if λ and 1 λ have the same multiplicity, for each eigenvalue λ , then G is said to have the strong reciprocal eigenvalue property (SR). Till date, all the classes of bipartite graphs that are found to have property (R), are found to have property (SR) and it is not known whether these two properties are equivalent even for the bipartite graphs with a unique perfect matching. Among nonbipartite graphs, there is only one known graph class for which these two properties are not equivalent. In this article, we construct some more classes of nonbipartite graphs with property (R) but not (SR). [ABSTRACT FROM AUTHOR]

The goal of this contribution is to reveal the analytical framework and synthesis guidelines for frontal-attacking targets (FRATs) and flankattacking targets (FLATs) from the point of view of a graph as a mathematical object. The final outcome of this study are three graph models that in many ways describe the shooting targets under consideration. The first graph model characterizes the structure of connections between the vertices using an undirected graph. The model showed that the complexity of silhouettes leads to an increase of the path in the graph and growth of the complexity of its internal structure. The second graph model allows the analysis of the connectivity of the graph vertices. In this case, a bipartite graph is used. As a result, the reviewed FRATs and FLATs are described by the same graph. The second model showed its indifference to the types of the used graphic primitives (GPs). The third graph model was developed for the analysis of the common borders of the neighboring GPs and it uses a bipartite graph. It is also indifferent to the types of the used GPs, but it takes into account the length of the common borders. The third model describes FRATs/FLATs groups in the same way. When using I-III models, one can design GPs and carry out the synthesis of new targets. A full group of flank-attacking targets consisting of five silhouettes and their GPs is offered. [ABSTRACT FROM AUTHOR]

A graphis nonsingular if its adjacency matrixis nonsingular. A nonsingular graphis said to have an inverseifis signature similar to a nonnegative matrix. An-graphis a bipartite graph with a unique perfect matching. We introduce the ‘even’ness of a nonmatching edge and show that under certain conditions a connected-graph has an inverse if and only ifis bipartite, whereis the set of all even nonmatching edges. This extends some known results, providing us with a larger class of graphs possessing inverses. [ABSTRACT FROM PUBLISHER]

With a nonzero rectangular ( 0 , 1 ) -matrix A we associate an undirected graph G A that corresponds to the linear transformation X ↦ A X T A . We use the generalized singular-value decomopsition of incidence matrices to count the number of connected components and the number of bipartite connected components of G A . We show that G A is connected if and only if G A has no bipartite connected component or isolated vertex. We also show that if A has no row or column of 0's, then the number of connected components is 1 2 s ( s + 1 ) and the number of bipartite connected components is 1 2 s ( s − 1 ) , where s is the number of chainable components of A , that is, the number of connected components in the undirected graph with adjacency matrix ( O A A T O ) . [ABSTRACT FROM AUTHOR]

Abstract: In this paper we characterize the unique graph whose least eigenvalue attains the minimum among all connected graphs of fixed order and given number of cut vertices, and then obtain a lower bound for the least eigenvalue of a connected graph in terms of the number of cut vertices. During the discussion we also get some results for the spectral radius of a connected bipartite graph and its upper bound. [Copyright &y& Elsevier]