Graphs which,with their complements,have certain clique covering numbers

Two common invariants of a graph G are its node clique cover number, θ₀(G), and its edge clique cover number, θ₁(G). We present in this work a characterization of those graphs for which they and their complements, $\text{G}\text{?}$, have θ₀(G)=θ₁(G) and θ₀($\text{G}\text{?}$)=θ₁($\text{G}\text{?}$). Graphs satis ying these conditions are shown to constitute a subset of those graphs which we term C-graphs.     

On total matching numbers and total covering numbers of complementary graphs

Best upper and lower bounds, as functions of n, are obtained for the quantities $\text{β}{}_2\text{(G)+β}{}_2\text{(}\text{G}\text{?}\text{)}$ and $\text{α}{}_2\text{(G)+α}{}_2\text{(}\text{G}\text{?}\text{)}$, where β₂(G) denotes the total matching number and α₂(G) the total covering number of any graph G with n vertices and with complementry graph ?.The best upper bound is obtained also for α₂(G)+β₂(G), when G is a connected graph.     

On complementary graphs with no isolated vertices

Let $\text{G}$ denote the complement of a graph G, and x(G), β₁(G), β₄(G), α₀(G), α₁(G) denote respectively the chromatic number, line-independence number, point-independence number, point-covering number, line-covering number of G, Nordhaus and Gaddum showed that for any graph G of order $\text{p}\text{, {2√p} ? x(G) + x(}\text{G}\text{) ? p + 1}\text{and p}\text{? x(G)·x(}\text{G}\text{) ? [(}\text{1}\text{2}\text{(p + 1))}{}^2\text{]}$. Recently Chartrand and Schuster have given the corresponding inequalities for the independence numbers of any graph G. However, combining their result with Gallai's well known formula β₁(G) + α₁(G) = ?, one is not deduce the analogous bounds for the line-covering numbers of $\text{G}\text{and}\text{G}$, since Gallai's formula holds only if G contains no isolated vertex. The purpose of this note is to improve the results of Chartland and Schuster for line-independence numbers for graphs where both $\text{G}\text{and}\text{G}$ contain no isolated vertices and thereby allowing us to use Gallai's formula to get the corresponding bounds for the line-covering numbers of G.     

On a general class of graph polynomials

Let $\text{F}$ be a family of connected graphs. With each element α ∈ $\text{F}$, we can associate a weight w_α. Let G be a graph. An F-cover of G is a spanning subgraph of G in which every component belongs to $\text{F}$. With every F-cover we can associate a monomial π(C) = Π_αw_α, where the product is taken over all components of the cover. The F-polynomial of G is Σπ(C), where the sum is taken over all F-covers in G. We obtain general results for the complete graph and complete bipartite graphs, and we show that many of the well-known graph polynomials are special cases of more general F-polynomials.     

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.     

Some tree-star Ramsey Numbers

The Ramsey Number r(G₁, G₂) is the least integer N such that for every graph G with N vertices, either G has the graph G₁ as a subgraph or $\text{G}$, the complement of G, has the graph G₂ as a subgraph.In this paper we embed the paths P_m in a much larger class $\text{T}$ of trees and then show how some evaluations by T. D. Parsons of Ramsey numbers r(P_m, K_1,n), where K_1,n is the star of degree n, are also valid for r(T_m, K_1,n) where T_m ∈ $\text{T}$.     

On k-sequential and other numbered graphs

The concept of a k-sequential graph is presented as follows. A graph G with ∣V(G)∪ E(G)∣=t is called k-sequential if there is a bijection$\text{?: V(G)∪E(G) → {k,k+1,…,t+k?1}}$ such that for each edge$\text{e}\text{?}\text{=xy}$in E(G) one has$\text{?(}\text{e}\text{?}\text{) = ∣?(x)??(y)∣}$. A graph that is 1-sequential is called simply sequential, and, in particular the author has conjectured that all trees are simply sequential. In this paper an introductory study of k-sequential graphs is made. Further, several variations on the problems of gracefully or sequentially numbering the elements of a graph are discussed.     

Solution of the Hamiltonian problem for self-complementary graphs

A graph G is said to be highly constricted if there exists a nonempty subset S of vertices such that (i) G ? S has more than |S| components, (ii) S induces the complete graph, and (iii) for every u ∈ S and v ? S, we have d_G(u) > d_G(v), where d_G(u) denotes the degree of u in G. In this paper it is shown that a non-hamiltonian self-complementary graph G of order p is highly constricted, unless p = 4N and G is a particular graph $\text{G}{}^1\text{(4N)}$. It is also proved that if G is a self-complementary graph of order p(≥8) and π its degree sequence, then G is pancyclic if π has a realization with a hamiltonian cycle, and G has a 2-factor if π has a realization with a 2-factor, unless p = 4N and $\text{G = G}{}^1\text{(4N)}$.     

Some Asymptotic ith Ramsey numbers

Let G be a graph with chromatic number χ(G) and let t(G) be the minimum number of vertices in any color class among all χ(G)-vertex colorings of G. Let H′ be a connected graph and let H be a graph obtained by subdividing (adding extra vertices to) a fixed edge of H′. It is proved that if the order of H is sufficiently large, the ith Ramsey number r_i(G, H) equals $\text{[}\text{((χ(G)?1)(|}\text{H}\text{|?1)+t(G)?1)}\text{i}\text{]+1}$.     

Minimum number of edges in graphs that are both P2- and Pi-connected

A simple graph with n vertices is called P_i-connected if any two distinct vertices are connected by an elementary path of length i. In this paper, lower bounds of the number of edges in graphs that are both P₂- and P_i-connected are obtained. Namely if $\text{i?}\text{1}\text{2}\text{(n+1)}$, then |E(G)|?((4i?5)/(2i?2))(n?1), and if $\text{i >}\text{1}\text{2}\text{(n+ 1)}$, then |E(G)|?2(n?1) apart from one exeptional graph. Furthermore, extremal graphs are determined in the former.     

Computing the boxicity of a graph by covering its complement by cointerval graphs

If $\text{F}$ is a family of sets, its intersection graph has the sets in $\text{F}$ as vertices and an edge between two sets if and only if they overlap. This paper investigates the concept of boxicity of a graph G, the smallest n such that G is the intersection graph of boxes in Euclidean n-space. The boxicity, b(G), was introduced by Roberts in 1969 and has since been studied by Cohen, Gabai, and Trotter. The concept has applications to niche overlap (competition) in ecology and to problems of fleet maintenance in operations research. These applications will be described briefly. While the problem of computing boxicity is in general a difficult problem (it is NP-complete), this paper develops techniques for computing boxicity which give useful bounds. They are based on the simple observation that b(G)≤k if and only if there is an edge covering of $\text{G}$ by spanning subgraphs of $\text{G}$, each of which is a cointerval graph, the complement of an interval graph (a graph of boxicity ≤1.).     

Constructing a covering triangulation by means of a nowhere-zero dual flow

Tutte conjectured that every graph with no isthmus can be provided with an integral nowhere-zero flow with no absolute value greater than k=5. As yet the result is established for k=6, and it is used for proving that the existence of a triangular imbedding of a graph G in a surface S implies the existence of a triangular imbedding of G_(m) in a surface $\text{S}\text{?}$ with the same orientability characteristic as S. G_(m) stands for the composition of G by an independent set of m vertices.     

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)}$.     

On the eigenvalues and eigenvectors of certain finite,vertex-weighted,bipartite graphs

The established, spectral characterisation of bipartite graphs with unweighted vertices (which are here termed homogeneous graphs) is extended to those bipartite graphs (called heterogeneous) in which all of the vertices in one set are weighted h₁ , and each of those in the other set of the bigraph is weighted h₂. All the eigenvalues of a homogeneous bipartite graph occur in pairs, around zero, while some of the eigenvalues of an arbitrary, heterogeneous graph are paired around $\text{1}\text{2}$(h₁ + h₂), the remainder having the value h₂ (or h_l). The well-documented, explicit relations between the eigenvectors belonging to “paired” eigenvalues of homogeneous graphs are extended to relate the components of the eigenvectors associated with each couple of “paired” eigenvalues of the corresponding heterogeneous graph. Details are also given of the relationships between the eigenvectors of an arbitrary, homogeneous, bipartite graph and those of its heterogeneous analogue.     

The family of D-weights for a two-rooted graph

Let Π(G) be the set of paths of a particular class Π from the initial to the terminal root of a two-rooted (possibly directed) graph G. We consider the family of $\text{D}$-weights defined by

where Π_x(G) is the family of subsets of Π(G) which cover x(G), the vertex set or the edge (arc) set of G.A number of the common properties and interrelations of these weights are discussed. Some of the weights have been considered previously, [1, 2], in the context of percolation theory but here only combinatorial arguments are used.     

On subgraph number independence in trees

For finite graphs F and G, let N_F(G) denote the number of occurrences of F in G, i.e., the number of subgraphs of G which are isomorphic to F. If $\text{F}$ and $\text{G}$ are families of graphs, it is natural to ask then whether or not the quantities N_F(G), F∈$\text{F}$, are linearly independent when G is restricted to $\text{G}$. For example, if $\text{F}$ = {K₁, K₂} (where K_n denotes the complete graph on n vertices) and $\text{F}$ is the family of all (finite) trees, then of course N_K1(T) ? N_K2(T) = 1 for all T∈$\text{F}$. Slightly less trivially, if $\text{F}$ = {S_n: n = 1, 2, 3,…} (where S_n denotes the star on n edges) and $\text{G}$ again is the family of all trees, then Σ_n=1^∞(?1)ⁿ⁺¹N_Sn(T)=1 for all T∈$\text{G}$. It is proved that such a linear dependence can never occur if $\text{F}$ is finite, no F∈$\text{F}$ has an isolated point, and $\text{G}$ contains all trees. This result has important applications in recent work of L. Lovász and one of the authors (Graham and Lovász, to appear).     

On the rational spectra of graphs with abelian singer groups

Let G be a finite abelian group. We investigate those graphs $\text{G}$ admitting G as a sharply 1-transitive automorphism group and all of whose eigenvalues are rational. The study is made via the rational algebra $\text{P}$(G) of rational matrices with rational eigenvalues commuting with the regular matrix representation of G. In comparing the spectra obtainable for graphs in $\text{P}$(G) for various G's, we relate subschemes of a related association scheme, subalgebras of $\text{P}$(G), and the lattice of subgroups of G. One conclusion is that if the order of G is fifth-power-free, any graph with rational eigenvalues admitting G has a cospectral mate admitting the abelian group of the same order with prime-order elementary divisors.     

Uniqueness and faithfulness of embedding of toroidal graphs

A topological generalization of the uniqueness of duals of 3-connected planar graphs will be obtained. A graph G is uniquely embeddable in a surface F if for any two embeddings $\text{?}{}_1$, $\text{?}{}_2\text{:G → F}$, there are an autohomeomorphism h:F → F and an automorphism σ:G → G such that $\text{h°?}{}_1\text{= ?}{}_2\text{°σ}$. A graph G is faithfully embedabble in a surface F if there is an embedding $\text{?:G → F}$ such that for any automorphism σ:G → G, there is an autohomeomorphism h:F → F with $\text{h°? = f°σ}$. Our main theorems state that any 6-connected toroidal graph is uniquelly embeddable in a torus and that any 6-connected toroidal graph with precisely three exceptions is faithfully embeddable in a torus. The proofs are based on a classification of 6-regular torus graphs.     

The toroidal thickness of the symmetric quadripartite graph

The toroidal thickness t₁(G) of a graph G is the minimum value of k for which G is the edge-union of k graphs each embeddable on a torus. It is shown that $\text{t}{}_1\text{(K}{}_{\mathrm{4(n)}}\text{) = [}\text{1}\text{2}\text{(n + 1)]}$.