Degree sequence of the generalized Sierpiński graph
type: Item
instance of: scholarly article
zbMATH Open document ID: 1454.05024
author: Mahsa Khatibi
author: Fatemeh Attarzadeh
author: Ali Behtoei
publication date: 2021-02-11T00:00:00Z
full work available at URL: https://arxiv.org/abs/1901.06533
Mathematics Subject Classification ID: 05C07
Mathematics Subject Classification ID: 05C76
zbMATH DE Number: 7309083
zbMATH Keywords: degree sequence
zbMATH Keywords: generalized Sierpiński graph
zbMATH Keywords: general first Zagreb index
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W3123573516
title: Degree sequence of the generalized Sierpiński graph
cites work: Sum of powers of the degrees of graphs: extremal results and bounds
cites work: Metric properties of generalized Sierpiński graphs over stars
cites work: Covering codes in Sierpiński graphs
cites work: The star sequence and the general first Zagreb index
cites work: Some relations and bounds for the general first Zagreb index
cites work: The strong metric dimension of generalized Sierpiński graphs with pendant vertices
cites work: On the general Randić index of polymeric networks modelled by generalized Sierpiński graphs
cites work: Equitable \(L(2,1)\)-labelings of Sierpiński graphs
cites work: Total coloring for generalized Sierpiński graphs
cites work: New results on variants of covering codes in Sierpiński graphs
cites work: On \(p\)-Kostka numbers and Young modules.
cites work: An efficient algorithm to determine all shortest paths in Sierpiński graphs
cites work: A survey and classification of Sierpiński-type graphs
cites work: Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
cites work: The Tower of Hanoi -- myths and maths. With a foreword by Ian Stewart
cites work: Coloring Hanoi and Sierpiński graphs
cites work: On topological properties of Sierpinski networks
cites work: A 2-parametric generalization of Sierpiński gasket graphs.
cites work: Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
cites work: 1-perfect codes in Sierpiński graphs
cites work: Crossing numbers of Sierpiński‐like graphs
cites work: Hamming dimension of a graph-the case of Sierpiński graphs
cites work: Connectivity and some other properties of generalized Sierpiński graphs
cites work: The hub number of Sierpiński-like graphs
cites work: Some properties of the first general Zagreb index
cites work: The Wiener index of Sierpiński-like graphs
cites work: On some metric properties of the Sierpiński graphs \(S(n,k)\)
cites work: Q4786551
cites work: On the roman domination number of generalized Sierpiński graphs
cites work: On generalized Sierpiński graphs
cites work: On the Randić index of polymeric networks modelled by generalized Sierpiński graphs
cites work: Shortest Paths in the Tower of Hanoi Graph and Finite Automata
cites work: Spectral analysis on infinite Sierpiński gaskets
cites work: Trees with the first three smallest and largest generalized topological indices
cites work: A unified approach to the extremal trees for different indices
DOI: 10.11575/CDM.V15I3.68174
Recommended article: Q4320263
Recommended article: Degree sequences in graphs
Recommended article: Graphs with a given degree sequence
Recommended article: Degree sequence and supereulerian graphs
Recommended article: Degree sequences of multigraphs
Recommended article: On generalized Sierpiński graphs
Recommended article: Q2971217
Recommended article: Degree sequences of graphs and dominance order
Recommended article: Q3025190
description: scientific article; zbMATH DE number 7309083