Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Broader families of cordial graphs
View through CrossRef
<p>A binary labeling of the vertices of a graph <em>G</em> is cordial if the number of vertices labeled 0 and the number of vertices labeled 1 differ by at most 1, and the number of edges of weight 0 and the number of edges of weight 1 differ by at most 1. In this paper we present general results involving the cordiality of graphs that results of some well-known operations such as the join, the corona, the one-point union, the splitting graph, and the super subdivision. In addition we show a family of cordial circulant graphs.</p>
UPT Penerbitan Universitas Jember
Title: Broader families of cordial graphs
Description:
<p>A binary labeling of the vertices of a graph <em>G</em> is cordial if the number of vertices labeled 0 and the number of vertices labeled 1 differ by at most 1, and the number of edges of weight 0 and the number of edges of weight 1 differ by at most 1.
In this paper we present general results involving the cordiality of graphs that results of some well-known operations such as the join, the corona, the one-point union, the splitting graph, and the super subdivision.
In addition we show a family of cordial circulant graphs.
</p>.
Related Results
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, ...
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...
Computing the Energy of Certain Graphs based on Vertex Status
Computing the Energy of Certain Graphs based on Vertex Status
Background:
The concept of Hückel molecular orbital theory is used to compute the graph energy numerically and graphically on the base of the status of a vertex.
Objective:
Our a...
SP Mean E-Cordial Labeling
SP Mean E-Cordial Labeling
Assigning an integer to a vertices or edges is called a vertex or edge labeling respectively. Suppose G is a simple graph. Consider the function f for the edge set . For each vert...
Obligation by religation. A complementary reading of Adela Cortina's cordial ethics and Xavier Zubiri's analysis of social reality
Obligation by religation. A complementary reading of Adela Cortina's cordial ethics and Xavier Zubiri's analysis of social reality
In her Ethics of Cordial Reason, Adela Cortina proposes a “cordial bond” as the foundation of moral obligation: a bond between people, deeply felt and intuitively known, which lead...
Twilight graphs
Twilight graphs
AbstractThis paper deals primarily with countable, simple, connected graphs and the following two conditions which are trivially satisfied if the graphs are finite:(a) there is an ...
Eigenspectral Analysis of Pendant Vertex- and Pendant Edge-Weighted Graphs of Linear Chains, Cycles, and Stars
Eigenspectral Analysis of Pendant Vertex- and Pendant Edge-Weighted Graphs of Linear Chains, Cycles, and Stars
Abstract
Three classes of pendent vertex- and pendant edge-weighted graphs of linear chains (class I), stars (class II), and cycles (class III) have been presented. ...
On Tuza's conjecture in even co-chain graphs
On Tuza's conjecture in even co-chain graphs
In 1981, Tuza conjectured that the cardinality of a minimum set of edges that intersects every triangle of a graph is at most twice the cardinality of a maximum set of edge-disjoin...