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

The bandwidth of the complement of a \(k\)-tree

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

DOI10.1007/S11766-998-0058-7zbMath0921.05055OpenAlexW2322449578MaRDI QIDQ1288223

Jinjiang Yuan, Yanpei Liu

Publication date: 12 September 1999

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-998-0058-7


zbMATH Keywords

bandwidthtrees


Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)





Cites Work

  • Optimal numberings and isoperimetric problems on graphs
  • Unnamed Item
  • Unnamed Item




This page was built for publication: The bandwidth of the complement of a \(k\)-tree

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