On the maximum density of graphs with unique-path labelings

DOI10.1137/120898528MaRDI QIDQ2870502zbMATH OpenOpenAlexFDO

Authors Abbas Mehrabian, D. Mitsche, Paweł Prałat

Publication date 21 January 2014

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/120898528

zbMATH Keywords

edge densitygood edge-labellingsnondecreasing pathsunique-path labellings

Mathematics Subject Classification ID

Paths and cycles (05C38) Density (toughness, etc.) (05C42) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• scientific article; zbMATH DE number 6129705
• The density maximization problem in graphs
• The density maximization problem in graphs
• The unique -min labelings of graphs
• On the density of maximal 1-planar graphs
• scientific article; zbMATH DE number 2043351
• The maximum degree and (p,1)-total labeling of graphs
• On the structure of unique shortest paths in graphs
• scientific article; zbMATH DE number 4021183
• Maximum graphs with a unique minimum dominating set

Cited in

(6)

• On 1-uniqueness and dense critical graphs for tree-depth
• A solution to a problem of Gargano, Lewinter and Malerba
• Distribution of the sum-of-digits function of random integers: a survey
• On the density of nearly regular graphs with a good edge-labeling
• scientific article; zbMATH DE number 6129705 (Why is no real title available?)
• On the parameterized complexity of computing good edge-labelings

This page was built for publication: On the maximum density of graphs with unique-path labelings

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