The process of deleting the edges, the corresponding spanning tree T of GP(6, 1) and the components of GP(6, 1) \ T.

The process of deleting the edges, the corresponding spanning tree T of GP(6, 1) and the components of GP(6, 1) \ T.

Source publication
Article
Full-text available
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

Context 1
... instance, the corresponding spanning tree, T for the graph GP(6, 1) and the components of the GP(6, 1) \ T are shown in Figure 2. ...

Similar publications

Preprint
Full-text available
A class $\mathcal{G}$ of graphs is hereditary if it is closed under taking induced subgraphs. We denote by $\mathcal{G}^\mathrm{add}$ the class of graphs that are at most one edge addition away from being in $\mathcal{G}$, and by $\mathcal{G}^\mathrm{epex}$ the class of graphs that are at most one edge deletion away from being in $\mathcal{G}$. In...
Preprint
Full-text available
A numbering $f$ of a graph $G$ of order $n$ is a labeling that assigns distinct elements of the set $\left\{ 1,2,\ldots ,n\right\} $ to the vertices of $G$, where each $uv\in E\left( G\right) $ is labeled $f\left( u\right) +f\left( v\right) $. The strength $\mathrm{str}\left( G\right) $ of $G$ is defined by $\mathrm{str}\left( G\right) =\min \left\...
Preprint
Full-text available
Let $G=(V,E)$ be a finite, simple, and connected graph. The locating-chromatic number of a graph $G$ can be defined as the cardinality of a minimum resolving partition of the vertex set $V(G)$ such that all vertices have different coordinates and every two adjacent vertices in $G$ is not contained in the same partition class. In this case, the coor...
Article
Full-text available
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...