Javascript must be enabled to continue!

Even Star Decomposition of Complete Bipartite Graphs

A decomposition (G1, G2, G3,… , Gn) of a graph G is an Arithmetic Decomposition(AD) if |E(Gi)| = a + (i – 1)d for all i = 1, 2,… , n and a, d∈Z+. Clearly q = n/2 [2a + (n – 1)d]. The AD is a CMD if a = 1 and d = 1. In this paper we introduced the new concept Even Decomposition of graphs. If a = 2 and d = 2 in AD, then q = n(n + 1). That is, the number of edges of G is the sum of first n even numbers 2, 4, 6,… , 2n. Thus we call the AD with a = 2 and d = 2 as Even Decomposition. Since the number of edges of each subgraph of G is even, we denote the Even Decomposition as (G2, G4,… , G2n).

Canadian Center of Science and Education

E. Ebin Raja Merly J. Suthiesh Goldy

Journal of Mathematics Research

2016

Title: Even Star Decomposition of Complete Bipartite Graphs

Description:

Clearly q = n/2 [2a + (n – 1)d].

The AD is a CMD if a = 1 and d = 1.

In this paper we introduced the new concept Even Decomposition of graphs.

If a = 2 and d = 2 in AD, then q = n(n + 1).

That is, the number of edges of G is the sum of first n even numbers 2, 4, 6,… , 2n.

Thus we call the AD with a = 2 and d = 2 as Even Decomposition.

Since the number of edges of each subgraph of G is even, we denote the Even Decomposition as (G2, G4,… , G2n).

.

Back

If I find out that you have bought a $90 red light sabre, Tara, well there's going to be trouble. -- Kevin Brabazon A few Saturdays ago, my 71-year old father tried to...

Complete (2,2) Bipartite Graphs

A bipartite graph G can be treated as a (1,1) bipartite graph in the sense that, no two vertices in the same part are at distance one from each other. A (2,2) bipartite graph is an...

Independent Set in Neutrosophic Graphs

New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...

Failed Independent Number in Neutrosophic Graphs

New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...

Fidelity and entanglement of random bipartite pure states: insights and applications

Abstract We investigate the fidelity of Haar random bipartite pure states from a fixed reference quantum state and their bipartite entanglement. By plotting the fide...

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...

Simulating the Overall Hospital Quality Star Ratings With Random Measure Weights

ImportanceHospital ratings including the US News &amp; World Report’s Best Hospitals rankings and the Centers for Medicare &amp; Medicaid Services’ (CMS’) Overall H...

Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage

Abstract Chordal graphs are characterized as the intersection graphs of subtrees in a tree and such a representation is known as the tree model. Restricting the characteriz...

Email:
Password:

Email:

Even Star Decomposition of Complete Bipartite Graphs

Related Results