TRANSACTIONS ON COMBINATORICS
Year:2019 | Volume:8 | Issue:2|Papers Count:5

For a simple connected graph G with n vertices and m edges, let 􀀀 ! G be a digraph obtained by giving an arbitrary direction to the edges of G. In this paper, we consider the skew Laplacian/skew adjacency matrix of the digraph 􀀀 ! G. We obtain upper bounds for the skew Laplacian/skew adjacency spectral radius, in terms of various parameters (like oriented degree, average oriented degree) associated with the structure of the digraph 􀀀 ! G. We also obtain upper and lower bounds for the skew Laplacian/skew adjacency spectral radius, in terms of skew Laplacian/skew adjacency rank of the digraph 􀀀 ! G.

For a simple connected graph G of order n and size m, the Laplacian energy of G is de ned as LE(G) = Σ n i=1 j i 􀀀 2m n j where  1;  2; : : :;  n􀀀 1;  n are the Laplacian eigenvalues of G satisfying  1   2 


  n􀀀 1 >  n = 0. In this note, some new lower bounds on the graph invariant LE(G) are derived. The obtained results are compared with some already known lower bounds of LE(G).

This paper de nes the concept of partitioned hypergraphs, and enumerates the number of these hypergraphs and discrete complete hypergraphs. A positive equivalence relation is de ned on hypergraphs, this relation establishes a connection between hypergraphs and graphs. Moreover, we de ne the concept of (extended) derivable graph. Then a connection between hypergraphs and (extended) derivable graphs was investigated. Via the positive equivalence relation on hypergraphs, we show that some special trees are derivable graph and complete graphs are self derivable graphs.

Given a graph G, a graph F is said to be Ramsey for G if in every edge coloring of F with two colors, there exists a monochromatic copy of G. The minimum number of edges of a graph F which is Ramsey for G is called the size-Ramsey number of G and is denoted by ^r(G). In 1983, Beck gave a linear upper bound (in terms of n) for ^r(Pn), where Pn is a path on n vertices, giving a positive answer to a question of Erd}os. After that, different approaches were attempted by several authors to reduce the upper bound for ^r(Pn) for sufficiently large n and most of these approaches are based on the classic models of random graphs. Also, Haxell and Kohayakama in 1994 proved that the size Ramsey number of the cycle Cn is linear in terms n, however the Szemeredi's regularity lemma is used in their proof and so no speci c constant coefficient is provided. Here, we provide a method to obtain an upper bound for the size Ramsey number of a graph using good expander graphs such as Ramanujan graphs. In particular, we give an alternative proof for the linearity of the size Ramsey number of paths and cycles. Our method has two privileges in compare to the previous ones. Firstly, it proves the upper bound for every positive integer n in comparison to the random graph methods which needs n to be sufficiently large. Also, due to the recent explicit constructions for bipartite Ramanujan graphs by Marcus, Spielman and Srivastava, we can constructively  nd the graphs with small sizes which are Ramsey for a given graph. We also obtain some results about the bipartite Ramsey numbers.

Let G = (V; E) be a connected graph and 􀀀 (G) be the strong access structure where obtained from graph G. A visual cryptography scheme (VCS) for a set P of participants is a method to encode a secret image such that any pixel of this image change to m subpixels and only quali ed sets can recover the secret image by stacking their shares. The value of m is called the pixel expansion and the minimum value of the pixel expansion of a VCS for 􀀀 (G) is denoted by m  (G). In this paper we obtain a characterization of all connected graphs G with m  (G) = 4 and! (G) = 5 which! (G) is the clique number of graph G.