The average eccentricity of Sierpiński graphs

DOI10.1007/s00373-011-1076-4zbMath1256.05058OpenAlexW1994665486WikidataQ60691933 ScholiaQ60691933MaRDI QIDQ1926020

Daniele Parisse, Andreas M. Hinz

Publication date: 27 December 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1076-4

zbMATH Keywords

integer sequenceseccentricityaverage eccentricitySierpiński graphsHanoi graphsTower of Hanoi

Mathematics Subject Classification ID

Bell and Stirling numbers (11B73) Factorials, binomial coefficients, combinatorial functions (05A10) Distance in graphs (05C12) Special sequences and polynomials (11B83)

Related Items (39)

Eccentricity based topological indices of honeycomb networks ⋮ On generalized Sierpiński graphs ⋮ Eccentricity-based topological indices of a cyclic octahedron structure ⋮ Packing chromatic number of base-3 Sierpiński graphs ⋮ The median of Sierpiński graphs ⋮ Metric properties of Sierpiński triangle graphs ⋮ Sierpiński graphs as spanning subgraphs of Hanoi graphs ⋮ On autographix conjecture regarding domination number and average eccentricity ⋮ Global strong defensive alliances of Sierpiński-like graphs ⋮ The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs ⋮ Open problems for Hanoi and Sierpiński graphs ⋮ On the general Randić index of polymeric networks modelled by generalized Sierpiński graphs ⋮ Asymptotic properties of Fibonacci cubes and Lucas cubes ⋮ An efficient algorithm to determine all shortest paths in Sierpiński graphs ⋮ Coloring Hanoi and Sierpiński graphs ⋮ Eccentricity based topological indices of an oxide network ⋮ Edge-grafting transformations on the average eccentricity of graphs and their applications ⋮ The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs ⋮ Further results regarding the sum of domination number and average eccentricity ⋮ Metric properties of Sierpiński-like graphs ⋮ The number of moves of the largest disc in shortest paths on Hanoi graphs ⋮ Coloring the square of Sierpiński graphs ⋮ The Wiener index of Sierpiński-like graphs ⋮ On distances in generalized Sierpiński graphs ⋮ A survey and classification of Sierpiński-type graphs ⋮ Constructing almost peripheral and almost self-centered graphs revisited ⋮ Generalized power domination: propagation radius and Sierpiński graphs ⋮ The linear \(t\)-colorings of Sierpiński-like graphs ⋮ Structural properties of subdivided-line graphs ⋮ The \((d, 1)\)-total labelling of Sierpiński-like graphs ⋮ Constructing uniform central graphs and embedding into them ⋮ On graphs with maximum average eccentricity ⋮ ECCENTRIC DISTANCE SUM OF SIERPIŃSKI GASKET AND SIERPIŃSKI NETWORK ⋮ On the relation between Wiener index and eccentricity of a graph ⋮ Shortest paths in Sierpiński graphs ⋮ On some bounds of the topological indices of generalized Sierpiński and extended Sierpiński graphs ⋮ Recognizing generalized Sierpiński graphs ⋮ Simplified constructions of almost peripheral graphs and improved embeddings into them ⋮ The outer-connected domination number of Sierpiński-like graphs

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coloring Hanoi and Sierpiński graphs
• A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles
• Vertex-, edge-, and total-colorings of Sierpiński-like graphs
• The average distance on the Sierpiński gasket
• Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
• The tower of Hanoi
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• 1-perfect codes in Sierpiński graphs
• Pascal's Triangle and the Tower of Hanoi
• Crossing numbers of Sierpiński‐like graphs
• Shortest Paths in the Tower of Hanoi Graph and Finite Automata

This page was built for publication: The average eccentricity of Sierpiński graphs