Topological graph dimension

In the invited chapter Discrete Spatial Models of the book Handbook of Spatial Logics, we have introduced the concept of dimension for graphs, which is inspired by Evako’s idea of dimension of graphs [A.V. Evako, R. Kopperman, Y.V. Mukhin, Dimensional properties of graphs and digital spaces, J. Math. Imaging Vision 6 (1996) 109-119]. Our definition is analogous to that of (small inductive) dimension in topology. Besides the expected properties of isomorphism-invariance and monotonicity with respect to subgraph inclusion, it has the following distinctive features:

•

Local aspect. That is, dimension at a vertex is basic, and the dimension of a graph is obtained as the sup over its vertices.

•

Dimension of a strong product G×H is dim(G)+dim(H) (for non-empty graphs G,H).

In this paper we present a short account of the basic theory, with several new applications and results.     

Chromatic capacity and graph operations

The chromatic capacityχ_cap(G) of a graph G is the largest k for which there exists a k-coloring of the edges of G such that, for every coloring of the vertices of G with the same colors, some edge is colored the same as both its vertices. We prove that there is an unbounded function f:N→N such that χ_cap(G)?f(χ(G)) for almost every graph G, where χ denotes the chromatic number. We show that for any positive integers n and k with k?n/2 there exists a graph G with χ(G)=n and χ_cap(G)=n-k, extending a result of Greene. We obtain bounds on that are tight as r→∞, where is the complete n-partite graph with r vertices in each part. Finally, for any positive integers p and q we construct a graph G with χ_cap(G)+1=χ(G)=p that contains no odd cycles of length less than q.     

Topological entropy of a graph map

Let G be a graph and f : G → G be a continuous map. Denote by h(f), P(f), AP(f), R(f)and ω(x, f) the topological entropy of f, the set of periodic points of f, the set of almost periodic points of f, the set of recurrent points of f and the ω-limit set of x under f, respectively. In this paper,we show that the following statements are equivalent:(1) h(f) 0.(2) There exists an x ∈ G such that ω(x, f) ∩ P(f) = ? and ω(x, f) is an infinite set.(3) There exists an x ∈ G such that ω(x, f)contains two minimal sets.(4) There exist x, y ∈ G such that ω(x, f)-ω(y, f) is an uncountable set and ω(y, f) ∩ω(x, f) = ?.(5) There exist an x ∈ G and a closed subset A ? ω(x, f) with f(A) ? A such that ω(x, f)-A is an uncountable set.(6) R(f)-AP(f) = ?.(7) f |P(f)is not pointwise equicontinuous.     

Closed graph theorem: Topological approach

Some new types of Closed Graph Theorem are presented. These results generalize some theorems of T. Byczkowski, R. Pol and M. Wilhelm. An answer to a problem of M. Wilhelm is provided. This paper was completed while the second named author was a Visiting Professor at Young-stown State University.     

Topological sweep of the complete graph

We present a novel, simple and easily implementable algorithm to report all intersections in an embedding of a complete graph. For graphs with N vertices and complexity K measured as the number of segments of the embedding, the running time of the algorithm is Θ(K+NM), where M is the maximum number of edges cut by any vertical line. Our algorithm handles degeneracies, such as vertical edges or multiply intersecting edges, without requiring numerical perturbations to achieve general position.The algorithm is based on the sweep line technique, one of the most fundamental techniques in computational geometry, where an imaginary line passes through a given set of geometric objects, usually from left to right. The algorithm sweeps the graph using a topological line, borrowing the concept of horizon trees from the topological sweep method [H. Edelsbrunner, L.J. Guibas, Topologically sweeping an arrangement, J. Comput. Syst. Sci. 38 (1989) 165-194; J. Comput. Syst. Sci. 42 (1991) 249-251 (corrigendum)].The novelty in our approach is to control the topological line through the use of the moving wall that separates at any time the graph into two regions: the region of known structure, in front of the moving wall, and the region that may contain intersections generated by edges-that have not yet been registered in the sweep process-behind the wall.Our method has applications to graph drawing and for depth-based statistical analysis, for computing the simplicial depth median for a set of N data points [G. Aloupis, S. Langerman, M. Soss, G. Toussaint, Algorithms for bivariate medians and a Fermat-Torricelli problem for lines, Comp. Geom. Theory Appl. 26 (1) (2003) 69-79].We present the algorithm, its analysis, experimental results and extension of the method to general graphs.     

The Zagreb coindices of graph operations

Recently introduced Zagreb coindices are a generalization of classical Zagreb indices of chemical graph theory. We explore here their basic mathematical properties and present explicit formulae for these new graph invariants under several graph operations.     

Topological games and continuity of group operations

We consider a topological game GΠ involving two players α and β and show that, for a paratopological group, the absence of a winning strategy for player β implies the group is a topological one. We provide a large class of topological spaces X for which the absence of a winning strategy for player β is equivalent to the requirement that X is a Baire space. This allows to extend the class of paratopological or semitopological groups for which one can prove that they are, actually, topological groups.Conditions of the type “existence of a winning strategy for the player α” or “absence of a winning strategy for the player β” are frequently used in mathematics. Though convenient and satisfactory for theoretical considerations, such conditions do not reveal much about the internal structure of the topological space where they hold. We show that the existence of a winning strategy for any of the players in all games of Banach-Mazur type can be expressed in terms of “saturated sieves” of open sets.     

Computing the eccentric-distance sum for graph operations

In this paper, we present explicit formulas for computing the eccentric-distance sum of the most important graph operations such as the Cartesian product, join, composition, disjunction, symmetric difference, cluster and corona product of graphs. Also, we apply our results to compute this eccentricity-related invariant for some important classes of molecular graphs and nano-structures by specializing components of these graph operations.     

The hyper-Zagreb index and some graph operations

Let G be a simple connected graph. The Hyper-Zagreb index is defined as \(\textit{HM}(G)=\sum _{uv\in E_{G}}(d_{G}(u)+d_{G}(v))^2\). In this paper some exact expressions for the hyper-Zagreb index of graph operations containing cartesian product and join of n graphs, splice, link and chain of graphs will be presented. We also apply these results to some graphs to chemical and general interest, such as \(C_4\) nanotube, rectangular grid, prism, complete n-partite graph.     

Kirchhoff index of graphs and some graph operations

Let T be a rooted tree, G a connected graph, x, y ∈ V(G) be fixed and G _i ’s be |V(T)| disjoint copies of G with x _i and y _i denoting the corresponding copies of x and y in G _i , respectively. We define the T-repetition of G to be the graph obtained by joining y _i to x _j for each i ∈ V(T) and each child j of i. In this paper, we compute the Kirchhoff index of the T-repetition of G in terms of parameters of T and G. Also we study how Kf(G) behaves under some graph operations such as joining vertices or subdividing edges.     

Topological properties of the one dimensional exponential random geometric graph

In this article we study the one‐dimensional random geometric (random interval) graph when the location of the nodes are independent and exponentially distributed. We derive exact results and limit theorems for the connectivity and other properties associated with this random graph. We show that the asymptotic properties of a graph with a truncated exponential distribution can be obtained using the exponential random geometric graph. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008     

Graph operations and upper bounds on graph homomorphism counts

We construct a family of countexamples to a conjecture of Galvin [5], which stated that for any n‐vertex, d‐regular graph G and any graph H (possibly with loops), where is the number of homomorphisms from G to H. By exploiting properties of the graph tensor product and graph exponentiation, we also find new infinite families of H for which the bound stated above on holds for all n‐vertex, d‐regular G. In particular, we show that if H_WR is the complete looped path on three vertices, also known as the Widom–Rowlinson graph, then for all n‐vertex, d‐regular G. This verifies a conjecture of Galvin.     

An enhanced DEA Russell graph efficiency measure

The measurement of productive efficiency is an issue of great interest. Since Farrell (Farrell, M.J., 1957. Journal of Royal Statistical Society, Series A 120, 253) implemented the first measure of technical efficiency, many researchers have developed new measures or have extended the already existing ones. The beginning of Data Envelopment Analysis (DEA) meant a new way of empirically measuring productive efficiency. Under some specific technologies, Farrell's measure was implemented giving rise to the first DEA models, CCR (Charnes, A., Cooper, W.W., Rhodes, E., 1978. European Journal of Operational Research 2, 429) and BCC (Banker, R.D., Charnes, A., Cooper, W.W., 1984. Management Science, 1078). The fact that these measures only account for radial inefficiency has motivated the development of the so-called Global Efficiency Measures (GEMs) (Cooper, W.W., Pastor, J.T., 1995. Working Paper, Departamento de Estadı́stica e Investigación Operativa, Universidad de Alicante, Alicante, Spain). In this paper we propose a new GEM inspired by the Russell Graph Measure of Technical Efficiency which avoids the computational and interpretative difficulties with this latter measure. Additionally, the new measure satisfies some other desirable properties.     

The first and second Zagreb indices of some graph operations

In this paper some exact expressions for the first and second Zagreb indices of graph operations containing the Cartesian product, composition, join, disjunction and symmetric difference of graphs will be presented. We apply some of our results to compute the Zagreb indices of arbitrary C₄ tube, C₄ torus and q-multi-walled polyhex nanotorus.     

Some inequalities for the atom-bond connectivity index of graph operations

The atom-bond connectivity index is a useful topological index in studying the stability of alkanes and the strain energy of cycloalkanes. In this paper some inequalities for the atom-bond connectivity index of a series of graph operations are presented. We also prove our bounds are tight. As an application, the ABC indices of C₄ nanotubes and nanotori are computed.     

Bipartition of graph under degree constraints

Let G be a graph, let s be a positive integer, and let X be a subset of V(G). Denote δ(X) to be the minimum degree of the subgraph G[X] induced by X. A partition(X, Y) of V(G) is called s-good if min{δ(X), δ(Y)} s. In this paper, we strengthen a result of Maurer and a result of Arkin and Hassin, and prove that for any positive integer k with 2 k |V(G)|- 2, every connected graph G with δ(G) 2 admits a1-good partition(X, Y) such that |X| = k and |Y| = |V(G)|- k, and δ(X) + δ(Y) δ(G)- 1.     

On graph equivalences preserved under extensions

Let G be the set of finite graphs whose vertices belong to some fixed countable set, and let ≡ be an equivalence relation on G. By the strengthening of ≡ we mean an equivalence relation ≡_s such that G≡_sH, where G,H∈G, if for every F∈G, G∪F≡H∪F. The most important case that we study in this paper concerns equivalence relations defined by graph properties. We write G≡^ΦH, where Φ is a graph property and G,H∈G, if either both G and H have the property Φ, or both do not have it. We characterize the strengthening of the relations ≡^Φ for several graph properties Φ. For example, if Φ is the property of being a k-connected graph, we find a polynomially verifiable (for k fixed) condition that characterizes the pairs of graphs equivalent with respect to . We obtain similar results when Φ is the property of being k-colorable, edge 2-colorable, Hamiltonian, or planar, and when Φ is the property of containing a subgraph isomorphic to a fixed graph H. We also prove several general theorems that provide conditions for ≡_s to be of some specific form. For example, we find a necessary and sufficient condition for the relation ≡_s to be the identity. Finally, we make a few observations on the strengthening in a more general case when G is the set of finite subsets of some countable set.     

在GCH之下Banach空间的拓扑同构

本文在广义连续统假设2^N_α=N_α+1(简记为GCH)下,给出Banach空间的一个拓扑同构定理。