Bounds on the domination number and the metric dimension of co-normal product of graphs
From MaRDI portal
Publication:824651
DOI10.1186/s13660-018-1752-5zbMath1498.05085OpenAlexW2810479349WikidataQ64937206 ScholiaQ64937206MaRDI QIDQ824651
Imran Javaid, Shahid ur Rehman, Muhammad Imran
Publication date: 15 December 2021
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-018-1752-5
Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the metric dimension of corona product graphs
- Mastermind
- Coloring the Cartesian sum of graphs
- Dominating sets in social network graphs
- On the chromatic number of the lexicographic product and the Cartesian sum of graphs
- Resolvability in graphs and the metric dimension of a graph
- Edge regular graph products
- Landmarks in graphs
- The metric dimension of strong product graphs
- The Domination Number of On-line Social Networks and Random Geometric Graphs
- On the Strong Metric Dimension of Cartesian Sum Graphs
- On the Metric Dimension of Cartesian Products of Graphs
- Extremal Graph Theory for Metric Dimension and Diameter
- Total domination in graphs
- Structure-activity maps for visualizing the graph variables arising in drug design
- On the Laplacian spectra of product graphs
- Chromatic Number of Cartesian Sum of Two Graphs
- On chromatic number of products of two graphs
- A Combinatory Detection Problem
- The metric dimension of the lexicographic product of graphs
- Graph-Theoretic Concepts in Computer Science
- The metric dimension of the lexicographic product of graphs
This page was built for publication: Bounds on the domination number and the metric dimension of co-normal product of graphs
