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

Spanners of underlying graphs of iterated line digraphs

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

DOI10.1016/S0020-0190(97)00074-4zbMath1337.68208MaRDI QIDQ287078

Rabah Harbane, Carles Padró

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)


zbMATH Keywords

interconnection networksline digraph\(t\)-spanner


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10)


Related Items (2)

Spanners of de Bruijn and Kautz graphs ⋮ Edge-disjoint spanners of complete graphs and complete digraphs



Cites Work

  • Unnamed Item
  • Delaunay graphs are almost as good as complete graphs
  • The underlying graph of a line digraph
  • Diameter vulnerability of iterated line digraphs
  • Graph spanners
  • Spanners in graphs of bounded degree
  • Spanners of Hypercube-Derived Networks
  • Grid spanners
  • Additive graph spanners


This page was built for publication: Spanners of underlying graphs of iterated line digraphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:287078&oldid=12169726"
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 03:01.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki