The Basis Number of Quadruple Join of Graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The locating chromatic number of the join of graphs

‎Let $f$ be a proper $k$-coloring of a connected graph $G$ and‎ ‎$Pi=(V_1,V_2,ldots,V_k)$ be an ordered partition of $V(G)$ into‎ ‎the resulting color classes‎. ‎For a vertex $v$ of $G$‎, ‎the color‎ ‎code of $v$ with respect to $Pi$ is defined to be the ordered‎ ‎$k$-tuple $c_{{}_Pi}(v)=(d(v,V_1),d(v,V_2),ldots,d(v,V_k))$‎, ‎where $d(v,V_i)=min{d(v,x):~xin V_i}‎, ‎1leq ileq k$‎. ‎If‎ ‎distinct...

متن کامل

SIGNED ROMAN DOMINATION NUMBER AND JOIN OF GRAPHS

In this paper we study the signed Roman dominationnumber of the join of graphs. Specially, we determine it for thejoin of cycles, wheels, fans and friendship graphs.

متن کامل

the locating chromatic number of the join of graphs

‎let $f$ be a proper $k$-coloring of a connected graph $g$ and‎ ‎$pi=(v_1,v_2,ldots,v_k)$ be an ordered partition of $v(g)$ into‎ ‎the resulting color classes‎. ‎for a vertex $v$ of $g$‎, ‎the color‎ ‎code of $v$ with respect to $pi$ is defined to be the ordered‎ ‎$k$-tuple $c_{{}_pi}(v)=(d(v,v_1),d(v,v_2),ldots,d(v,v_k))$‎, ‎where $d(v,v_i)=min{d(v,x):~xin v_i}‎, ‎1leq ileq k$‎. ‎if‎ ‎distinct...

متن کامل

The Locating Chromatic Number of the Join of Graphs

Let f be a proper k-coloring of a connected graph G and Π = (V1, V2, . . . , Vk) be an ordered partition of V (G) into the resulting color classes. For a vertex v of G, the color code of v with respect to Π is defined to be the ordered k-tuple cΠ(v) = (d(v, V1), d(v, V2), . . . , d(v, Vk)), where d(v, Vi) = min{d(v, x) : x ∈ Vi}, 1 ≤ i ≤ k. If distinct vertices have distinct color codes, then f...

متن کامل

On the fixed number of graphs

‎A set of vertices $S$ of a graph $G$ is called a fixing set of $G$‎, ‎if only the trivial automorphism of $G$ fixes every vertex in $S$‎. ‎The fixing number of a graph is the smallest cardinality of a fixing‎ ‎set‎. ‎The fixed number of a graph $G$ is the minimum $k$‎, ‎such that ‎every $k$-set of vertices of $G$ is a fixing set of $G$‎. ‎A graph $G$‎ ‎is called a $k$-fixed graph‎, ‎if its fix...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: AL-Rafidain Journal of Computer Sciences and Mathematics

سال: 2012

ISSN: 2311-7990

DOI: 10.33899/csmj.2012.163685