Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The linear complexity of a graph

From MaRDI portal
Publication:813437
Jump to:navigation, search

zbMath1080.05092MaRDI QIDQ813437

David L. Neel, Michael E. Orrison

Publication date: 9 February 2006

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/125526


zbMATH Keywords

adjacency matrices


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items (3)

On the likelihood of forests ⋮ On measuring the complexity of networks: Kolmogorov complexity versus entropy ⋮ Consistency matters: revisiting the structural complexity for supply chain networks






This page was built for publication: The linear complexity of a graph

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:813437&oldid=12752423"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 11:06.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki