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

Bimagic vertex labelings

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

DOI10.1007/s10559-018-0079-zzbMath1403.05131OpenAlexW2894383552MaRDI QIDQ1711390

V. N. Nedilko, S. N. Nedilko, Marina F. Semeniuta

Publication date: 17 January 2019

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-018-0079-z


zbMATH Keywords

distance magic labeling1-vertex bimagic vertex labelingeven 1-vertex bimagic vertex labelingodd 1-vertex bimagic vertex labeling


Mathematics Subject Classification ID

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





Cites Work

  • On \((a,d)\)-distance anti-magic and 1-vertex bimagic vertex labelings of certain types of graphs
  • A dynamic survey of graph labeling
  • Handicap distance antimagic graphs and incomplete tournaments
  • Numbered complete graphs, unusual rulers, and assorted applications
  • Distance labeling in graphs
  • On 1-vertex bimagic vertex labeling
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: Bimagic vertex labelings

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