Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
On Vector Basis S-Cordial Graph
View through CrossRef
Let be a graph. Let be an inner product space with basis . We denote the inner product of the vectors x and y by Let be a function. For each edge assign the label. We say that is a vector basis -cordial labeling if and where denotes the number of vertices labeled with the vector and denotes the number of edges labeled with the scalar . A graph with a vector basis -cordial labeling is called a vector basis -cordial graph. In this paper, we investigate the vector basis-cordial labeling behavior of corona product of alternate generalized snake graph with m copies of K1 graph where is a basis in .Let be a graph. Let be an inner product space with basis . We denote the inner product of the vectors x and y by Let be a function. For each edge assign the label. We say that is a vector basis -cordial labeling if and where denotes the number of vertices labeled with the vector and denotes the number of edges labeled with the scalar . A graph with a vector basis -cordial labeling is called a vector basis -cordial graph. In this paper, we investigate the vector basis-cordial labeling behavior of corona product of alternate generalized snake graph with m copies of K1 graph where is a basis in ????4 .
Academic Science Publications and Distributions
Title: On Vector Basis S-Cordial Graph
Description:
Let be a graph.
Let be an inner product space with basis .
We denote the inner product of the vectors x and y by Let be a function.
For each edge assign the label.
We say that is a vector basis -cordial labeling if and where denotes the number of vertices labeled with the vector and denotes the number of edges labeled with the scalar .
A graph with a vector basis -cordial labeling is called a vector basis -cordial graph.
In this paper, we investigate the vector basis-cordial labeling behavior of corona product of alternate generalized snake graph with m copies of K1 graph where is a basis in .
Let be a graph.
Let be an inner product space with basis .
We denote the inner product of the vectors x and y by Let be a function.
For each edge assign the label.
We say that is a vector basis -cordial labeling if and where denotes the number of vertices labeled with the vector and denotes the number of edges labeled with the scalar .
A graph with a vector basis -cordial labeling is called a vector basis -cordial graph.
In this paper, we investigate the vector basis-cordial labeling behavior of corona product of alternate generalized snake graph with m copies of K1 graph where is a basis in ????4 .
Related Results
E-Cordial Labeling of Some Families of Graphs
E-Cordial Labeling of Some Families of Graphs
An E-cordial labeling σ: E →{0,1} induces σ∗: V →{0,1} on graph G=(V,E), where (σ(v)=(∑_(u∈V)▒〖σ(uv)〗) mod 2 is taken over all edges uv∈E, and the labelling satisfies the condition...
FP-cordial labeling of product and corona-related graphs
FP-cordial labeling of product and corona-related graphs
Let [Formula: see text] be a [Formula: see text] graph.
Let [Formula: see text] Let [Formula: see text] be a bijection. For each edge [Formula: see text], assign ...
Graph convolutional neural networks for 3D data analysis
Graph convolutional neural networks for 3D data analysis
(English) Deep Learning allows the extraction of complex features directly from raw input data, eliminating the need for hand-crafted features from the classical Machine Learning p...
Graph data warehousing
Graph data warehousing
Over the last decade, we have witnessed the emergence of networks in a wide spectrum of application domains, ranging from social and information networks to biological and transpor...
Some Characterizations and NP-Complete Problems for Power Cordial Graphs
Some Characterizations and NP-Complete Problems for Power Cordial Graphs
A power cordial labeling of a graph
G
=
...
As Raízes e o Futuro do “Homem Cordial” Segundo Sérgio Buarque de Holanda
As Raízes e o Futuro do “Homem Cordial” Segundo Sérgio Buarque de Holanda
O texto faz uma
análise do
método utilizado por Sérgio Buarque de Holanda e
de seu
conceito de Homem Cordial, ...
Total edge product cordial labeling of graphs
Total edge product cordial labeling of graphs
The total product cordial labeling is a variant of cordial labeling. We introduce an edge analogue product cordial labeling as a variant of total product cordial labeling and name ...
Group mean cordial labeling of some splitting graphs
Group mean cordial labeling of some splitting graphs
Let \(G\) be a \((p, q)\) graph and let \(A\) be a group. Let \(f: V(G) \longrightarrow A\) be a map. For each edge \(u v\) assign the label \(\left\lfloor\frac{o(f(u))+o(f(v))}{2...