Advances in Network Complexity

From MaRDI portal

Revision as of 19:20, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2840486

Jump to:navigation, search

DOI10.1002/9783527670468zbMath1269.00010OpenAlexW657199265MaRDI QIDQ2840486

No author found.

Publication date: 18 July 2013

Full work available at URL: https://doi.org/10.1002/9783527670468

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to information and communication theory (94-06) Proceedings, conferences, collections, etc. pertaining to biology (92-06) Graph theory (05Cxx)

Related Items (6)

Entropy bounds for dendrimers ⋮ Degree-based entropies of networks revisited ⋮ On graph entropy measures based on the number of independent sets and matchings ⋮ Extremality of degree-based graph entropies ⋮ Coexistence of Stochastic Oscillations and Self-Organized Criticality in a Neuronal Network: Sandpile Model Application ⋮ Graph operations based on using distance-based graph entropies

This page was built for publication: Advances in Network Complexity

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2840486&oldid=15765093"