Polyhedral graph

In geometric graph theory, a branch of mathematics, a polyhedral graph is the undirected graph formed from the vertices and edges of a convex…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

The Graovac-Pisanski index ( GP index) is an algebraic approach for generalizing the Wiener index. In this paper, we co mpute the…

2016

A modified Wiener number was proposed by Graovać and Pisanski. It is based on the full automorphism group of a graph. In this…

2016

When the number of non-triangular faces adjacent to a vertex $v$ is less than or equal to three, the vertex $v$ will be called…

2015

. In this paper, we propose a method for realizing a polyhedral graph as a deltahedron, i.e., a polyhedron with congruent…

2015

Let G be a simple graph, the vertex-set and edge-set of which are represented by V (G) and E(G) respectively. In this paper, the…

2014

This paper addresses upper and lower bounds for the cardinality of a maximum vertex-/edge-disjoint cycle packing in a polyhedral…

2013

The author has recently developed an interactive modeling system of uniform polyhedra including Platonic solids, Archimedean…

Review

2011

Review

2011

This paper contains a survey of different methods for generating knots and links based on geometric polyhedra, suitable for…

2006

The rainbowness, rb(G), of a connected plane graph G is the minimum number k such that any colouring of vertices of the graph G…

1995

The family of 5-valent polyhedral graphs whose faces are all triangles or 3s-gons, s ≥ 9, is shown to contain non-hamiltonian…