Adjacent vertex distinquishing edge colorings of the direct product of a regular graph by a path or cycle.
Laura FrigerioFederico LastariaNorma Zagaglia SalviPublished in: Discuss. Math. Graph Theory (2011)
Keyphrases
- edge weights
- undirected graph
- weighted graph
- strongly connected
- vertex set
- shortest path
- directed graph
- disjoint paths
- spanning tree
- minimum weight
- bipartite graph
- minimum cost
- solution path
- hamiltonian cycle
- graph structure
- labeled graphs
- approximation algorithms
- directed acyclic graph
- minimum spanning tree
- life cycle
- root node
- connected components
- graph clustering
- graph coloring
- structured data
- hamiltonian path
- random graphs
- edge information
- graph model
- complex networks
- shortest path problem
- graph partitioning
- graph databases
- graph theory
- edge detector
- maximum cardinality