# On Mean Cordial Graphs

## Related Articles

- RADIO NUMBERS FOR GENERALIZED PRISM GRAPHS. MARTINEZ, PAUL; ORTIZ, JUAN; TOMOVA, MAGGY; WYELS, CINDY // Discussiones Mathematicae: Graph Theory;2011, Vol. 31 Issue 1, p45
No abstract available.

- Degree Splitting Graph on Graceful, Felicitous and Elegant Labeling. Selvaraju, P.; Balaganesan, P.; Renuka, J.; Balaj, V. // International Journal of Mathematical Combinatorics;Apr2012, Vol. 2, p96
We show that the degree splitting graphs of Bn,n; Pn; Km,n; n(k4 -3e)I; n(k4 - 3e)II(b); n(k4 - e)II and n(k4 - 2e)II(a) are graceful [3]. We prove C3 ï¿½K1,n is graceful, felicitous and elegant [2], Also we prove K2,n is felicitous and elegant.

- ON DOUBLY LIGHT VERTICES IN PLANE GRAPHS. KOZÁKOVÁ, VERONIKA; MADARAS, TOMÁŠ // Discussiones Mathematicae: Graph Theory;2011, Vol. 31 Issue 2, p333
No abstract available.

- ON THE CROSSING NUMBERS OF Gâ–¡Cn FOR GRAPHS G ON SIX VERTICES. DRAŽENSKÁ, EMILIA; KLEŠČ, MARIÁN // Discussiones Mathematicae: Graph Theory;2011, Vol. 31 Issue 2, p239
No abstract available.

- THE CROSSING NUMBERS OF JOIN PRODUCTS OF PATHS WITH GRAPHS OF ORDER FOUR. KLEŠČ, MARIÁN; SCHRÖTTER, ŠTEFAN // Discussiones Mathematicae: Graph Theory;2011, Vol. 31 Issue 2, p321
No abstract available.

- Nordhaus-Gaddum results for the sum of the induced path number of a graph and its complement. Hattingh, Johannes; Saleh, Ossama; Merwe, Lucas; Walters, Terry // Acta Mathematica Sinica;Dec2012, Vol. 28 Issue 12, p2365
The induced path number Ï( G) of a graph G is defined as the minimum number of subsets into which the vertex set of G can be partitioned so that each subset induces a path. Broere et al. proved that if G is a graph of order n, then $$\sqrt n \leqslant \rho \left( G \right) + \rho \left( {\bar...

- On Sullivan's conjecture on cycles in 4-free and 5-free digraphs. Liang, Hao; Xu, Jun // Acta Mathematica Sinica;Jan2013, Vol. 29 Issue 1, p53
For a simple digraph G, let Î²( G) be the size of the smallest subset X âŠ† E( G) such that Gâˆ’X has no directed cycles, and let Î³( G) be the number of unordered pairs of nonadjacent vertices in G. A digraph G is called k-free if G has no directed cycles of length at most k. This...

- CHARACTERIZATION OF CUBIC GRAPHS G WITH irt(G) = IRt(G) = 2. ESLAHCHI, CHANGIZ; HAGHI, SHAHAB; JAFARI RAD, NADER // Discussiones Mathematicae: Graph Theory;2014, Vol. 34 Issue 3, p559
A subset S of vertices in a graph G is called a total irredundant set if, for each vertex v in G, v or one of its neighbors has no neighbor in S -{v}. The total irredundance number, ir(G), is the minimum cardinality of a maximal total irredundant set of G, while the upper total irredundance...

- On The Isoperimetric Number of Line Graphs. Aslan, Ersin; Kirlangic, Alpay // International Journal of Mathematical Combinatorics;Dec2011, Vol. 4, p76
The isoperimetric number of a graph G, denoted i(G), was introduced in 1987 by Mohar [8]. Given a graph G and a subset of X of its vertices, let (X) denote the edge boundary of X: i.e. the set of edges which connect vertices in X with vertices not in X. The isoperimetric number of G defined as...