Szeged Dimension and $PI_v$ Dimension of Composite Graphs
نویسنده
چکیده مقاله:
Let $G$ be a simple connected graph. In this paper, Szeged dimension and PI$_v$ dimension of graph $G$ are introduced. It is proved that if $G$ is a graph of Szeged dimension $1$ then line graph of $G$ is 2-connected. The dimensions of five composite graphs: sum, corona, composition, disjunction and symmetric difference with strongly regular components is computed. Also explicit formulas of Szeged and PI$_v$ indices for these composite graphs is obtained.
منابع مشابه
dedekind modules and dimension of modules
در این پایان نامه، در ابتدا برای مدول ها روی دامنه های پروفر شرایط معادل به دست آورده ایم و خواصی از ددکیند مدول ها روی دامنه های پروفر مشخص کرده ایم. در ادامه برای ددکیند مدول های با تولید متناهی روی حلقه های به طور صحیح بسته شرایط معادل به دست آورده ایم و ددکیند مدول های ضربی را مشخص کرده ایم. گزاره هایی در مورد بعد ددکیند مدول ها بیان کرده ایم. در پایان، قضایای lying over و going down را برا...
15 صفحه اولThe metric dimension and girth of graphs
A set $Wsubseteq V(G)$ is called a resolving set for $G$, if for each two distinct vertices $u,vin V(G)$ there exists $win W$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The minimum cardinality of a resolving set for $G$ is called the metric dimension of $G$, and denoted by $dim(G)$. In this paper, it is proved that in a connected graph $...
متن کاملFractal Dimension of Graphs of Typical Continuous Functions on Manifolds
If M is a compact Riemannian manifold then we show that for typical continuous function defined on M, the upper box dimension of graph(f) is as big as possible and the lower box dimension of graph(f) is as small as possible.
متن کاملthe metric dimension and girth of graphs
a set $wsubseteq v(g)$ is called a resolving set for $g$, if for each two distinct vertices $u,vin v(g)$ there exists $win w$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. the minimum cardinality of a resolving set for $g$ is called the metric dimension of $g$, and denoted by $dim(g)$. in this paper, it is proved that in a connected graph $...
متن کاملDimension 4 and dimension 5 graphs with minimum edge set
The dimension of a graph G is defined to be the minimum n such that G has a representation as a unit-distance graph in R. A problem posed by Paul Erdős asks for the minimum number of edges in a graph of dimension 4. In a recent article, R. F. House showed that the answer to Erdős’ question is 9. In this article, we give a shorter (and we feel more straightforward) proof of House’s result, and t...
متن کاملSeparation dimension of sparse graphs
The separation dimension of a graph G is the smallest natural number k for whichthe vertices of G can be embedded in Rk such that any pair of disjoint edges in G canbe separated by a hyperplane normal to one of the axes. Equivalently, it is the smallestpossible cardinality of a family F of permutations of the vertices of G such that for anytwo disjoint edges of G, there exists a...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 13 شماره 2
صفحات 45- 57
تاریخ انتشار 2018-10
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023