نتایج جستجو برای: generalized prism graph
تعداد نتایج: 366110 فیلتر نتایج به سال:
The concept of 2-rainbow domination of a graph G coincides with the ordinary domination of the prism G K2. In this paper, we show that the problem of deciding if a graph has a 2-rainbow dominating function of a given weight is NP-complete even when restricted to bipartite graphs or chordal graphs. Exact values of 2-rainbow domination numbers of several classes of graphs are found, and it is sho...
A (p, q)-graph G is (a, d)-edge antimagic total if there exists a bijection f : V (G) ∪ E(G) → {1, 2, . . . , p + q} such that the edge weights Λ(uv) = f(u) + f(uv) + f(v), uv ∈ E(G) form an arithmetic progression with first term a and common difference d. It is said to be a super (a, d)-edge antimagic total if the vertex labels are {1, 2, . . . , p} and the edge labels are {p+ 1, p+ 2, . . . ,...
The prism over a graph G is the Cartesian product G2K2 of G with the complete graph K2. If G is hamiltonian, then G2K2 is also hamiltonian but the converse does not hold in general. Having a hamiltonian prism is shown to be an interesting relaxation of being hamiltonian. In this paper, we examine classical problems on hamiltonicity of graphs in the context of having a hamiltonian prism. c © ???...
A theta in a graph is an induced subgraph consisting of two nonadjacent vertices joined by three disjoint paths. A prism in a graph is an induced subgraph consisting of two disjoint triangles joined by three disjoint paths. This paper gives a polynomial-time algorithm to test whether a graph has an induced subgraph that is either a prism or a theta.
Prism exposure produces 2 kinds of adaptive response. Recalibration is ordinary strategic remapping of spatially coded movement commands to rapidly reduce performance error. Realignment is the extraordinary process of transforming spatial maps to bring the origins of coordinate systems into correspondence. Realignment occurs when spatial discordance signals noncorrespondence between spatial map...
Prism exposure produces two kinds of adaptive response. Recalibration is ordinary strategic remapping of spatially coded movement commands to rapidly reduce performance error. Realignment is the extraordinary process of transforming spatial maps to bring the origins of coordinate systems into correspondence. Realignment occurs when spatial discordance signals non-correspondence between spatial ...
suppose $gamma$ is a graph with $v(gamma) = { 1,2, cdots, p}$and $ mathcal{f} = {gamma_1,cdots, gamma_p} $ is a family ofgraphs such that $n_j = |v(gamma_j)|$, $1 leq j leq p$. define$lambda = gamma[gamma_1,cdots, gamma_p]$ to be a graph withvertex set $ v(lambda)=bigcup_{j=1}^pv(gamma_j)$ and edge set$e(lambda)=big(bigcup_{j=1}^pe(gamma_j)big)cupbig(bigcup_{ijine(gamma)}{uv;uin v(gamma_i),vin ...
The prism over a graph G is the Cartesian product G2K2 of G with the complete graph K2. If G is hamiltonian, then G2K2 is also hamiltonian but the converse does not hold in general. Having a hamiltonian prism is shown to be a good measure how close a graph is to being hamiltonian. In this paper, we examine classical problems on hamiltonicity of graphs in the context of hamiltonian prisms.
W c © ??? John Wiley & Sons, Inc. e prove that a graph G of order n has a hamiltonian prism if and only if the graph Cl4n/3−4/3(G) has a hamiltonian prism where Cl4n/3−4/3(G) is the graph obtained from G by sequential adding edges between non-adjacent vertices whose degree sum is at least 4n/3− 4/3. We show that this cannot be improved to less than 4n/3− 5.
Let $G$ be a $(p,q)$ graph. Let $f:V(G)to{1,2, ldots, k}$ be a map where $k in mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $gcd(f(u),f(v))$. $f$ is called $k$-Total prime cordial labeling of $G$ if $left|t_{f}(i)-t_{f}(j)right|leq 1$, $i,j in {1,2, cdots,k}$ where $t_{f}(x)$ denotes the total number of vertices and the edges labelled with $x$. A graph with a $k$-total prime cordi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید