On D-distance (anti)magic labelings of shadow graph of some graphs.
Ngurah Anak Agung GedeNur InayahMohamad Irvan Septiar MustiPublished in: Electron. J. Graph Theory Appl. (2024)
Keyphrases
- graph representation
- graph structure
- graph theory
- directed graph
- labeled graphs
- weighted graph
- graph matching
- edge weights
- graph construction
- graph databases
- neighborhood graph
- graph theoretic
- graph classification
- adjacency matrix
- graph mining
- graph structures
- graph clustering
- graph theoretical
- bipartite graph
- graph model
- graph search
- random graphs
- graph isomorphism
- graph kernels
- graph partitioning
- undirected graph
- series parallel
- graph data
- graph properties
- subgraph isomorphism
- minimum spanning tree
- structural pattern recognition
- directed acyclic
- dynamic graph
- graph representations
- spanning tree
- maximum cardinality
- reachability queries
- finding the shortest path
- average degree
- disk resident
- dense subgraphs
- graph layout
- random walk
- maximum common subgraph
- maximum independent set
- graph transformation
- vertex set
- attributed graphs
- query graph
- maximum clique
- social graphs
- connected graphs
- distance measure
- graph drawing
- graph embedding
- structured data
- maximal cliques
- connected dominating set
- evolving graphs
- web graph
- graph patterns
- distance function
- frequent subgraphs
- bounded treewidth
- planar graphs
- topological information
- strongly connected
- association graph