Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

The minimum geodetic communication overlap graphs

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

DOI10.1016/S0893-9659(98)00018-4zbMATH Open1337.05105OpenAlexW2061045688WikidataQ128066442 ScholiaQ128066442MaRDI QIDQ289353FDOQ289353


Authors: J. Nieminen, M. Peltola Edit this on Wikidata


Publication date: 30 May 2016

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0893-9659(98)00018-4




Recommendations

  • On the structure of minimum communication overlap networks
  • Lower bounds on communication overlap of networks
  • The geodetic numbers of graphs and digraphs
  • scientific article; zbMATH DE number 1472187
  • On the geodetic number of a graph


zbMATH Keywords

communication networkscommunication overloadinggeodetic connectivity


Mathematics Subject Classification ID

Applications of graph theory (05C90) Communication theory (94A05) Communication networks in operations research (90B18)


Cites Work

  • Lower bounds on communication overlap of networks
  • On the structure of minimum communication overlap networks


Cited In (2)

  • On the structure of minimum communication overlap networks
  • Lower bounds on communication overlap of networks





This page was built for publication: The minimum geodetic communication overlap graphs

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:289353&oldid=12171635"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 02:04. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki