Figure 5 - available via license: Creative Commons Attribution 4.0 International
Content may be subject to copyright.
The corresponding spanning tree T 2 of GP(6, 2) and the components of GP(6, 2) \ T 2 . GP(n, 2) \ T 2 has the following components: Two graphs of length n/2 -1 (which corresponds to the removal of edges in the inner star-polygon), The component containing the vertices o 1 , o 2 on o 3 and the corresponding adjacent edges o n o 1 , o 1 o 2 and o 2 o 3 .
Source publication
In Topological graph theory, the maximum genus of graphs has been a fascinating subject. For a simple connected graph G, the maximum genus γM(G) is the largest genus of an orientable surface on which G has a 2-cell embedding. γM(G) has the upper bound, γM(G)≤[β/2], where β(G) denotes the Betti number and G is said to be upper embeddable if the equa...
Context in source publication
Similar publications
The parameter $q(G)$ of an $n$-vertex graph $G$ is the minimum number of distinct eigenvalues over the family of symmetric matrices described by $G$. We show that all $G$ with $e(\overline{G}) = |E(\overline{G})| \leq \lfloor n/2 \rfloor -1$ have $q(G)=2$. We conjecture that any $G$ with $e(\overline{G}) \leq n-3$ satisfies $q(G) = 2$. We show that...
We find explicit formulas for the radii and locations of the circles in all the optimally dense packings of two, three or four equal circles on any flat torus, defined to be the quotient of the Euclidean plane by the lattice generated by two independent vectors. We prove the optimality of the arrangements using techniques from rigidity theory and t...
In this paper, we present a constructive and proof-relevant development of graph theory, including the notion of maps, their faces and maps of graphs embedded in the sphere, in homotopy type theory (HoTT). This allows us to provide an elementary characterisation of planarity for locally directed finite and connected multigraphs that takes inspirati...
Given a digraph, an ordering of its vertices defines a \emph{backedge graph}, namely the undirected graph whose edges correspond to the arcs pointing backwards with respect to the order. The \emph{degreewidth} of a digraph is the minimum over all ordering of the maximum degree of the backedge graph. We answer an open question by Keeney and Lokshtan...
