|
|
|
|
the adjacency dimension of some path related trees
|
|
|
|
|
|
|
|
نویسنده
|
hardany elham ,behtoei ali
|
|
منبع
|
journal of mahani mathematical research - 2025 - دوره : 14 - شماره : 1 - صفحه:369 -386
|
|
چکیده
|
since the problem of computing the adjacency dimension of a graph is np-hard, finding the adjacency dimension of special classes of graphs or obtaining good bounds on this invariant is valuable. in this paper we determine the properties of each adjacency resolving set of paths. then, by using these properties, we determine the adjacency dimension of broom and double broom graphs.
|
|
کلیدواژه
|
adjacency resolving set، adjacency dimension، path، broom، tree
|
|
آدرس
|
imam khomeini international university, faculty of science, department of mathematics, iran, imam khomeini international university, faculty of science, department of mathematics, iran
|
|
پست الکترونیکی
|
a.behtoei@sci.ikiu.ac.ir
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|