On the public citation graph
On the partition dimension of comb product of path and complete graph
0 signed · 24 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/pl00000127openalex-snapshot
The partition dimension of a graph
inferredcites →https://doi.org/10.1016/j.amc.2010.08.038openalex-snapshot
A note on the partition dimension of Cartesian product graphs
inferredcites →https://doi.org/10.1016/j.dam.2013.09.026openalex-snapshot
On the partition dimension of trees
inferredcites →https://doi.org/10.1016/j.disc.2007.08.089openalex-snapshot
Discrepancies between metric dimension and partition dimension of a connected graph
inferredcites →https://doi.org/10.1016/j.disc.2014.04.026openalex-snapshot
The partition dimension of strong product graphs and Cartesian product graphs
inferredcites →https://doi.org/10.1016/j.ipl.2014.02.005openalex-snapshot
On the partition dimension of a class of circulant graphs
inferredcites →https://doi.org/10.1016/j.procs.2015.12.075openalex-snapshot
The Partition Dimension of a Subdivision of a Complete Graph
inferredcites →https://doi.org/10.1016/j.procs.2015.12.077openalex-snapshot
Partition Dimension of Some Classes of Trees
inferredcites →https://doi.org/10.1016/j.procs.2015.12.078openalex-snapshot
Partition Dimension of Some Classes of Homogenous Disconnected Graphs
inferredcites →https://doi.org/10.1016/s0166-218x(00)00198-0openalex-snapshot
Resolvability in graphs and the metric dimension of a graph
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/j.arabjc.2022.103923openalex-snapshot
Bounds on the partition dimension of one pentagonal carbon nanocone structure
inferred← citeshttps://doi.org/10.1088/1742-6596/1465/1/012022openalex-snapshot
Resolving domination number of helm graph and it’s operation
inferred← citeshttps://doi.org/10.1088/1742-6596/1538/1/012009openalex-snapshot
On the set chromatic number of the join and comb product of graphs
inferred← citeshttps://doi.org/10.1088/1742-6596/1538/1/012023openalex-snapshot
On the local multiset dimension of graph with homogenous pendant edges
inferred← citeshttps://doi.org/10.1088/1742-6596/1538/1/012093openalex-snapshot
The analysis of the implementation inquiry based learning to improve student mathematical proving skills in solving dominating metric dimention number
inferred← citeshttps://doi.org/10.1088/1742-6596/1836/1/012023openalex-snapshot
On local irregularity vertex coloring of comb product on star graphs
inferred← citeshttps://doi.org/10.1088/1742-6596/2157/1/012012openalex-snapshot
On resolving efficient domination number of path and comb product of special graph
inferred← citeshttps://doi.org/10.1142/s1793830922501488openalex-snapshot
Local irregular vertex coloring of comb product by path graph and star graph
inferred← citeshttps://doi.org/10.13189/ms.2023.110314openalex-snapshot
Upper Bound for Partition Dimension of Comb Product of a Wheel Graph and Tree
inferred← citeshttps://doi.org/10.2991/978-94-6463-138-8_2openalex-snapshot
On Resolving Efficient Dominating Set of Cycle and Comb Product Graph
inferred← citeshttps://doi.org/10.2991/978-94-6463-138-8_9openalex-snapshot
On the Resolving Efficient Domination Number of Path and Comb Product of Special Graph
inferred← citeshttps://doi.org/10.3934/mbe.2022471openalex-snapshot
Partition dimension of COVID antiviral drug structures
inferred← citeshttps://doi.org/10.48550/arxiv.1806.11465openalex-snapshot
Neighbor-Locating Colorings in Graphs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.