Connected graphs of fixed order and size with maximal index: Some spectral bounds

The index (or spectral radius) of a simple graph is the largest eigenvalue of its adjacency matrix. For connected graphs of fixed order and size the graphs with maximal index are not yet identified (in the general case). It is known (for a long time) that these graphs are nested split graphs (or threshold graphs). In this paper we use the eigenvector techniques for getting some new (lower and upper) bounds on the index of nested split graphs. Besides we give some computational results in order to compare these bounds.     

Connected signed graphs of fixed order,size, and number of negative edges with maximal index

In this paper we focus on connected signed graphs of fixed number of vertices, positive edges and negative edges that maximize the largest eigenvalue (also called the index) of their adjacency matrix. In the first step we determine these signed graphs in the set of signed generalized theta graphs. Concerning the general case, we use the eigenvector techniques for getting some structural properties of resulting signed graphs. In particular, we prove that positive edges induce nested split subgraphs, while negative edges induce double nested signed subgraphs. We observe that our concept can be applied when considering balancedness of signed graphs (the property that is extensively studied in both mathematical and non-mathematical context).     

The spectral characterization of graphs of index less than 2 with no path as a component

A graph is said to be determined by the adjacency and Laplacian spectrum (or to be a DS graph, for short) if there is no other non-isomorphic graph with the same adjacency and Laplacian spectrum, respectively. It is known that connected graphs of index less than 2 are determined by their adjacency spectrum. In this paper, we focus on the problem of characterization of DS graphs of index less than 2. First, we give various infinite families of cospectral graphs with respect to the adjacency matrix. Subsequently, the results will be used to characterize all DS graphs (with respect to the adjacency matrix) of index less than 2 with no path as a component. Moreover, we show that most of these graphs are DS with respect to the Laplacian matrix.     

三圈图的极小广义和连通指数

图的广义和连通指数作为新提出的一类分子拓扑指数, 在QSPR/QSAR 中有很大的应用价值. 树图、单圈图和双圈图的极值问题已取得很多结果, 而三圈图相关问题的研究较为复杂. 限制 - 1\leqslant \alpha < 0, 对三圈图的广义和连通指数进行了研究. 通过对三圈图的分析, 构造了一种图的变换, 指出在三圈图中广义和连通指 数的极小值必由其中的七种类型图取得. 然后通过悬挂边的变换, 最终得到三圈图广义和连通指 数的极小值并刻画了唯一的极图.     

Line graphs of complete multipartite graphs have small cycle double covers

It has been shown by MacGillivray and Seyffarth (Austral. J. Combin. 24 (2001) 91) that bridgeless line graphs of complete graphs, complete bipartite graphs, and planar graphs have small cycle double covers. In this paper, we extend the result for complete bipartite graphs, and show that the line graph of any complete multipartite graph (other than K_1,2) has a small cycle double cover.     

若干图类的Wiener指数的极值

一个图的Wiener指数是指这个图中所有点对的距离和.Wiener指数在理论化学中有广泛应用. 本文刻画了给定顶点数及特定参数如色数或团数的图中Wiener指数达最小值的图, 同时也刻画了给定顶点数及团数的图中Wiener指数达最大值的图.     

Cubic Bridgeless Graphs and Braces

There are many long-standing open problems on cubic bridgeless graphs, for instance, Jaeger’s directed cycle double cover conjecture. On the other hand, many structural properties of braces have been recently discovered. In this work, we bijectively map the cubic bridgeless graphs to braces which we call the hexagon graphs, and explore the structure of hexagon graphs. We show that hexagon graphs are braces that can be generated from the ladder on 8 vertices using two types of McCuaig’s augmentations. In addition, we present a reformulation of Jaeger’s directed cycle double cover conjecture in the class of hexagon graphs.     

三圈图的Harary指数

图G的Harary指数是指图G中所有顶点对间的距离倒数之和. 三圈图是指边数等于顶点数加2的连通图. 研究了三圈图的Harary数, 给出了所有三圈图中具有极大Harary指数的图的结构以及含有三个圈的三圈图中具有次大Harary指数的图的结构.     

Some notes on the threshold graphs

In this paper we consider threshold graphs (also called nested split graphs) and investigate some invariants of these graphs which can be of interest in bounding the largest eigenvalue of some graph spectra.     

On the spectral radii of weighted double stars

The spectra of weighted graphs are given attention by some authors because the graphs in the design of networks and electronic circuits are usually weighted. In this short paper, we completely determine the spectra of weighted double stars. We also give the weighted double star that achieves the maximal spectral radius.     

On small graphs critical with respect to edge colourings

A simple graph is said to be of class 1 or of class 2 according as its chromatic index equals the maximum degree or is one greater. A graph of class 2 is called critical if all its proper subgraphs have smaller chromatic index. It has been conjectured by Beineke and Wilson and by Jakobsen that all critical graphs have odd order. In this paper we verify the truth of this conjecture for all graphs of order less than 12 and all graphs of order 12 and maximum degree 3. We also determine all critical graphs through order 7.     

On critical graphs with chromatic index 4

It is shown that the number of vertices of valency 2 in a critical graph with chromatic index 4 is at most 1/3 of the total number of vertices, and that there exist critical graphs with just one vertex of valency 2, but none with exactly two vertices of valency 2. From this bounds for the number of edges are deduced. The paper ends with a presentation of a catalogue of all critical graphs with chromatic index 4 and at most 8 vertices, and all simple critical graphs with chromatic index 4 and at most 10 vertices.     

Tricyclic graphs with maximum Merrifield-Simmons index

It is well known that the graph invariant, ‘the Merrifield-Simmons index’ is important one in structural chemistry. The connected acyclic graphs with maximal and minimal Merrifield-Simmons indices are determined by Prodinger and Tichy [H. Prodinger, R.F. Tichy, Fibonacci numbers of graphs, Fibonacci Quart. 20 (1982) 16-21]. The sharp upper and lower bounds for the Merrifield-Simmons indices of unicyclic graphs are characterized by Pedersen and Vestergaard [A.S. Pedersen, P.D. Vestergaard, The number of independent sets in unicyclic graphs, Discrete Appl. Math. 152 (2005) 246-256]. The sharp upper bound for the Merrifield-Simmons index of bicyclic graphs is obtained by Deng, Chen and Zhang [H. Deng, S. Chen, J. Zhang, The Merrifield-Simmons index in (n,n+1)-graphs, J. Math. Chem. 43 (1) (2008) 75-91]. The sharp lower bound for the Merrifield-Simmons index of bicyclic graphs is determined by Jing and Li [W. Jing, S. Li, The number of independent sets in bicyclic graphs, Ars Combin, 2008 (in press)]. In this paper, we will consider the tricyclic graph, i.e., a connected graph with cyclomatic number 3. The tricyclic graph with n vertices having maximum Merrifield-Simmons index is determined.     

Chip-firing via open covers

We investigate chip-firing with respect to open covers of discrete graphs and metric graphs. For the case of metric graphs we show that given an open cover and a sink q, stabilization of a divisor D is unique and that there is a distinguished configuration equivalent to D, which we call the critical configuration. Also, we show that given a double cover of the metric graph by stars, which is the continuous analogue of the sandpile model, the critical configurations are in bijection with reduced divisors. Passing to the discrete case, we interpret open covers of a graph as simplicial complexes on the vertex and observe that chip-firing with respect to a simplicial complex is equivalent to the model introduced by Paoletti [G. Paoletti. July 11 2007: Master in Physics at University of Milan, defending thesis “Abelian sandpile models and sampling of trees and forests”; supervisor: Prof. S. Caracciolo. http://pcteserver.mi.infn.it/caraccio/index.html]. We generalize this setup for directed graphs using weighted simplicial complexes on the vertex set and show that the fundamental results extend. In the undirected case we present a generalization of the Cori-Le Borgne algorithm for chip-firing models via open covers, giving an explicit bijection between the critical configurations and the spanning trees of a graph.(http://www.elsevier.com/locate/endm)     

The Index of a Periodic Graph

For periodic graphs, a special class of infinite, but locally finite graphs, an index theory is developed that can serve in classifying these graphs and that enables connections with various graph invariants as in the case of finite graphs. The index is defined with the aid of certain finite matrices that result rather canonically from reductions of the infinite adjacency operator due to the periodicity. As a central result we derive a sharp global lower bound for the index of any periodic graph.     

Multigraphs with quasiweak odd cycles

In this paper we define a class of multigraphs with chromatic index equal to the maximum degree d. They are characterized by a property of their elementary odd cycles. It is shown that these graphs are panchromatic (i.e., they have a good k-coloring for any k). In the partially ordered set of color-feasible sequences of these graphs, all maximal sequences have at most d + 1 terms.     

Maximum Genus of Strong Embeddings

The strong embedding conjecture states that any 2-connected graph has a strong embedding on some surface. It implies the circuit double cover conjecture: Any 2-connected graph has a circuit double cover.Conversely, it is not true. But for a 3-regular graph, the two conjectures are equivalent. In this paper, a characterization of graphs having a strong embedding with exactly 3 faces, which is the strong embedding of maximum genus, is given. In addition, some graphs with the property are provided. More generally, an upper bound of the maximum genus of strong embeddings of a graph is presented too. Lastly, it is shown that the interpolation theorem is true to planar Halin graph.     

A successful algorithm for the undirected Hamiltonian path problem

In this paper a polynomial algorithm called the Minram algorithm is presented which finds a Hamiltonian Path in an undirected graph with high frequency of success for graphs up to 1000 nodes. It first reintroduces the concept described in [13] and then explains the algorithm. Computational comparison with the algorithm by Posa [10] is given.It is shown that a Hamiltonian Path is a spanning arborescence with zero ramification index. Given an undirected graph, the Minram algorithm starts by finding a spanning tree which defines a unique spanning arborescence. By suitable pivots it locates a locally minimal value of the ramification index. If this local minima corresponds to zero ramification index then the algorithm is considered to have ended successfully, else a failure is reported.Computational performance of the algorithm on randomly generated Hamiltonian graphs is given. The random graphs used as test problems were generated using the procedure explained in Section 6.1. Comparison with our version of the Posa algorithm which we call Posa-ran algorithm [10] is also made.     

Graphs with large palette index

Given an edge-coloring of a graph, the palette of a vertex is defined as the set of colors of the edges which are incident with it. We define the palette index of a graph as the minimum number of distinct palettes, taken over all edge-colorings, occurring among the vertices of the graph. Several results about the palette index of some specific classes of graphs are known. In this paper we propose a different approach that leads to new and more general results on the palette index. Our main theorem gives a sufficient condition for a graph to have palette index larger than its minimum degree. In the second part of the paper, by using such a result, we answer to two open problems on this topic. First, for every r odd, we construct a family of r-regular graphs with palette index reaching the maximum admissible value. After that, we construct the first known family of simple graphs whose palette index grows quadratically with respect to their maximum degree.     

Resistance characterizations of equiarboreal graphs

A weighted (unweighted) graph $G$ is called equiarboreal if the sum of weights (the number) of spanning trees containing a given edge in $G$ is independent of the choice of edge. In this paper, we give some resistance characterizations of equiarboreal weighted and unweighted graphs, and obtain the necessary and sufficient conditions for $k$-subdivision graphs, iterated double graphs, line graphs of regular graphs and duals of planar graphs to be equiarboreal. Applying these results, we obtain new infinite families of equiarboreal graphs, including iterated double graphs of 1-walk-regular graphs, line graphs of triangle-free 2-walk-regular graphs, and duals of equiarboreal planar graphs.