Highly linked graphs

A graph with at least 2k vertices is said to bek-linked if, for any choices ₁,...,s _k ,t ₁,...,t _k of 2k distinct vertices there are vertex disjoint pathsP ₁,...,P _k withP _i joinings _i tot _i , 1ik. Recently Robertson and Seymour [16] showed that a graphG isk-linked provided its vertex connectivityk(G) exceeds . We show here thatk(G)22k will do.     

Highly parity linked graphs

A graph G is k-linked if G has at least 2k vertices, and for any 2k vertices x ₁,x ₂, …, x _k ,y ₁,y ₂, …, y _k , G contains k pairwise disjoint paths P ₁, …, P _k such that P _i joins x _i and y _i for i = 1,2, …, k. We say that G is parity-k-linked if G is k-linked and, in addition, the paths P ₁, …, P _k can be chosen such that the parities of their length are prescribed. Thomassen [22] was the first to prove the existence of a function f(k) such that every f(k)-connected graph is parity-k-linked if the deletion of any 4k-3 vertices leaves a nonbipartite graph. In this paper, we will show that the above statement is still valid for 50k-connected graphs. This is the first result that connectivity which is a linear function of k guarantees the Erdős-Pósa type result for parity-k-linked graphs. Research partly supported by the Japan Society for the Promotion of Science for Young Scientists, by Japan Society for the Promotion of Science, Grant-in-Aid for Scientific Research and by Inoue Research Award for Young Scientists.     

Highly connected random geometric graphs

Let P be a Poisson process of intensity 1 in a square S_n of area n. We construct a random geometric graph G_n,k by joining each point of P to its k nearest neighbours. For many applications it is desirable that G_n,k is highly connected, that is, it remains connected even after the removal of a small number of its vertices. In this paper we relate the study of the s-connectivity of G_n,k to our previous work on the connectivity of G_n,k. Roughly speaking, we show that for s=o(logn), the threshold (in k) for s-connectivity is asymptotically the same as that for connectivity, so that, as we increase k, G_n,k becomes s-connected very shortly after it becomes connected.     

Edge irregular total labellings for graphs of linear size

As an edge variant of the well-known irregularity strength of a graph G=(V,E) we investigate edge irregular total labellings, i.e. functions f:V∪E→{1,2,…,k} such that f(u)+f(uv)+f(v)≠f(u^′)+f(u^′v^′)+f(v^′) for every pair of different edges uv,u^′v^′∈E. The smallest possible k is the total edge irregularity strength of G. Confirming a conjecture by Ivan?o and Jendrol’ for a large class of graphs we prove that the natural lower bound is tight for every graph of order n, size m and maximum degree Δ with m>111000Δ. This also implies that the probability that a random graph from G(n,p(n)) satisfies the Ivan?o-Jendrol’ Conjecture tends to 1 as n→∞ for all functions p∈[0,1]^N. Furthermore, we prove that is an upper bound for every graph G of order n and size m≥3 whose edges are not all incident to a single vertex.     

Gaussian bounds and parabolic Harnack inequality on locally irregular graphs

A well known theorem of Delmotte is that Gaussian bounds, parabolic Harnack inequality, and the combination of volume doubling and Poincaré inequality are equivalent for graphs. In this paper we consider graphs for which these conditions hold, but only for sufficiently large balls, and prove a similar equivalence.     

Highly connected multicoloured subgraphs of multicoloured graphs

Suppose the edges of the complete graph on n vertices, E(K_n), are coloured using r colours; how large a k-connected subgraph are we guaranteed to find, which uses only at most s of the colours? This question is due to Bollobás, and the case s=1 was considered in Liu et al. [Highly connected monochromatic subgraphs of multicoloured graphs, J. Graph Theory, to appear]. Here we shall consider the case s2, proving in particular that when s=2 and r+1 is a power of 2 then the answer lies between 4n/(r+1)-17kr(r+2k+1) and 4n/(r+1)+4, that if r=2s+1 then the answer lies between and , and that phase transitions occur at s=r/2 and . We shall also mention some of the more glaring open problems relating to this question.     

Highly edge-connected regular graphs without large factorizable subgraphs

We construct highly edge-connected $r$-regular graphs of even order which do not contain $r?2$ pairwise disjoint perfect matchings. When $r$ is a multiple of 4, the result solves a problem of Thomassen [4].     

New concepts of regular and (highly) irregular vague graphs with applications

In this paper, some types of vague graphs are introdaced such as $d_m$-regular, $t{d}_m$-regular, $m$-highly irregular and $m$-highly totally irregular vague graphs are introduced and some properties of them are discussed. Comparative study between $d_m$-regular ($m$-highly irregular) vague graph and $t{d}_m$-regular ($m$-highly totally irregular) vague graph are done. In addition, $d_m$-regularity and $m$-highly irregularity on some vague graphs, which underlying crisp graphs are a cycle or a path is also studied. Finally, some applications of regular vague graphs are given for demonstration of fullerene molecules, road transport network and wireless multihop networks.     

Highly edge‐connected detachments of graphs and digraphs

Let G = (V,E) be a graph or digraph and r : V → Z₊. An r‐detachment of G is a graph H obtained by ‘splitting’ each vertex ν ∈ V into r(ν) vertices. The vertices ν₁,…,ν_r(ν) obtained by splitting ν are called the pieces of ν in H. Every edge uν ∈ E corresponds to an edge of H connecting some piece of u to some piece of ν. Crispin Nash‐Williams 9 gave necessary and sufficient conditions for a graph to have a k‐edge‐connected r‐detachment. He also solved the version where the degrees of all the pieces are specified. In this paper, we solve the same problems for directed graphs. We also give a simple and self‐contained new proof for the undirected result. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 67–77, 2003     

Certain types of irregular <Emphasis Type="Italic">m</Emphasis>-polar fuzzy graphs

The notion of an m-polar fuzzy set is a generalization of a bipolar fuzzy set. We apply the concept of m-polar fuzzy sets to graphs. We introduce certain types of irregular m-polar fuzzy graphs and investigate some of their properties. We describe the concepts of types of irregular m-polar fuzzy graphs with several examples. We also present applications of m-polar fuzzy graphs in decision making and social network as examples.     

Cover-incomparability graphs and chordal graphs

The problem of recognizing cover-incomparability graphs (i.e. the graphs obtained from posets as the edge-union of their covering and incomparability graph) was shown to be NP-complete in general [J. Maxová, P. Pavlíkova, A. Turzík, On the complexity of cover-incomparability graphs of posets, Order 26 (2009) 229-236], while it is for instance clearly polynomial within trees. In this paper we concentrate on (classes of) chordal graphs, and show that any cover-incomparability graph that is a chordal graph is an interval graph. We characterize the posets whose cover-incomparability graph is a block graph, and a split graph, respectively, and also characterize the cover-incomparability graphs among block and split graphs, respectively. The latter characterizations yield linear time algorithms for the recognition of block and split graphs, respectively, that are cover-incomparability graphs.     

Graph equations for line graphs,total graphs,middle graphs and quasi-total graphs

Let G be a graph with vertex-set V(G) and edge-set X(G). Let L(G) and T(G) denote the line graph and total graph of G. The middle graph M(G) of G is an intersection graph Ω(F) on the vertex-set V(G) of any graph G. Let F = V′(G) ∪ X(G) where V′(G) indicates the family of all one-point subsets of the set V(G), then $\text{M(G) = Ω(F)}$.The quasi-total graph P(G) of G is a graph with vertex-set V(G)∪X(G) and two vertices are adjacent if and only if they correspond to two non-adjacent vertices of G or to two adjacent edges of G or to a vertex and an edge incident to it in G.In this paper we solve graph equations $\text{L(G) ? P(H);}\text{L(G)}\text{? P(H); P(G) ? T(H);}\text{P(G)}\text{? T(H); M(G) ? P(H);}\text{M(G)}\text{? P(H)}$.     

Comparability graphs and intersection graphs

A function diagram (f-diagram) D consists of the family of curves {$\text{1}\text{?}$ñ} obtained from n continuous functions $\text{f}{}_{\mathrm{i}}\text{:[0,1]→}\text{R}\text{(1?i?n)}$. We call the intersection graph of D a function graph (f-graph). It is shown that a graph G is an f-graph if and only if its complement ? is a comparability graph. An f-diagram generalizes the notion of a permulation diagram where the f_i are linear functions. It is also shown that G is the intersection graph of the concatenation of ?k permutation diagrams if and only if the partial order dimension of $\text{G}\text{?}\text{is ?k+1}$. Computational complexity results are obtained for recognizing such graphs.