Sierpinski gasket-based graphs in coding theory

zbMATH Open1198.94187MaRDI QIDQ3621176FDOQ3621176

Authors: Monika Kotorowicz 

Publication date: 14 April 2009

Full work available at URL: http://x.kerkoje.com/index.php/ajm/article/view/54

Recommendations

• Complex networks modeled on the Sierpinski gasket
• A 2-parametric generalization of Sierpiński gasket graphs.
• Recognizing generalized Sierpiński graphs
• scientific article; zbMATH DE number 5043398
• Coloring Sierpiński graphs and Sierpiński gasket graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Combinatorial codes (94B25)

Cited In (7)

• A graph-theoretic approach for studying the convergence of fractal encoding algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Phase transitions in the Ising model on a hierarchical random graph based on the triangle
• Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications
• Codes and \(L(2,1)\)-labelings in Sierpiński graphs
• SECRET CODING TECHNIQUE ON SUNFLOWER GRAPHS WITH PRODUCT CORDIAL LABELING

This page was built for publication: Sierpinski gasket-based graphs in coding theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3621176)