… Even so, the complexity of the problem still depends on the complexity of the graphs in
which the skewness we want to determine. In this project, we consider the family of cubic …

… , based on spanning trees, for … skewness of the n-dimensional hypercube Qn is also derived.
Finally, we explore the relationship between the skewness and crossing number of a graph. …

… We also consider graphs with girth 5 or higher. In Section 3 we show that among all graphs
requiring n colors, the complete graph on n vertices Kn is the one with the smallest skewness…

… two subgraphs in the cutset sum may often not be similar in size). It might be hoped that our
results on skewness may be usefully applied to them, or to subclasses of sparse graphs with …

… provide a survey on skewness of graphs and introduce some graphs which are π − skew. …
We prove some results concerning the skewness for the join of two graphs. We then use these …

… a directed graph. G is called the underlying graph of Gσ and we denote by S(Gσ) the
skew-adjacency matrix of Gσ and its spectrum Sp(Gσ) is called the skew-spectrum of Gσ. In this …

… For simplicity, we impose the following conditions on a drawing: (a) if two edges share an
interior point p, then they cross at p; (b) any two edges of a drawing have only a finite number …

… In this section, we show that, for hypercubes, skewness and Euler excess are equal on all
orientable surfaces. Arguments are based on a natural embedding of the hypercube into three-…

… In this paper we focus on the problem of determining the minimum rank of real skew-symmetric
matrices described by a unicyclic graph over real field R. Let G be a simple graph of …

… The skewness of \(G\), denoted \(sk(G)\), is defined to be the minimum number of … graph.
We show, by constructions, the existence of \(5\)-regular graphs on \(n\) vertices with skewness \(…