Login / Signup

The Bounds on the Locating-Chromatic Number for a Subdivision of a Graph on One Edge.

Ira Apni PurwasihEdy Tri BaskoroHilda AssiyatunDjoko Suprijanto
Published in: ICGTIS (2015)
Keyphrases
  • social networks
  • multiresolution
  • small number
  • weighted graph
  • lower bound
  • edge detection
  • random walk
  • structured data
  • edge detector
  • graph matching
  • edge information
  • maximum number
  • graph representation
  • disjoint paths