On Center, Periphery and Average Eccentricity for the Convex Polytopes
| Autor: | Mobeen Munir, Imrana Kousar, Ammara Sehar, Saima Nazeer, Young Chel Kwun, Shin Min Kang, Waqas Nazeer |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2016 |
| Předmět: |
Graph center
Physics and Astronomy (miscellaneous) General Mathematics Polytope eccentricity center periphery average eccentricity 0102 computer and information sciences 02 engineering and technology 01 natural sciences Combinatorics Center periphery Computer Science::Discrete Mathematics 0202 electrical engineering electronic engineering information engineering Computer Science (miscellaneous) Mathematics lcsh:Mathematics Neighbourhood (graph theory) Regular polygon lcsh:QA1-939 Graph Vertex (geometry) 010201 computation theory & mathematics Chemistry (miscellaneous) 020201 artificial intelligence & image processing Bound graph |
| Zdroj: | Symmetry; Volume 8; Issue 12; Pages: 145 Symmetry, Vol 8, Iss 12, p 145 (2016) |
| ISSN: | 2073-8994 |
| DOI: | 10.3390/sym8120145 |
| Popis: | A vertex v is a peripheral vertex in G if its eccentricity is equal to its diameter, and periphery P ( G ) is a subgraph of G induced by its peripheral vertices. Further, a vertex v in G is a central vertex if e ( v ) = r a d ( G ) , and the subgraph of G induced by its central vertices is called center C ( G ) of G . Average eccentricity is the sum of eccentricities of all of the vertices in a graph divided by the total number of vertices, i.e., a v e c ( G ) = { 1 n ∑ e G ( u ) ; u ∈ V ( G ) } . If every vertex in G is central vertex, then C ( G ) = G , and hence, G is self-centered. In this report, we find the center, periphery and average eccentricity for the convex polytopes. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|