All Research Papers Published In AKCE International Journal of Graphs and Combinatorics

Research Article
6
10.1016/j.akcej.2018.08.005

Isolate and independent domination number of some classes of graphs

Oct 11, 2018
AKCE International Journal of Graphs and Combinatorics
Shilpa T Bhangale + 1 more +1

Research Article
1
10.1016/j.akcej.2018.09.001

On 3-total edge product cordial labeling of a carbon nanotube network

Sep 17, 2018
AKCE International Journal of Graphs and Combinatorics
Martin Bača + 2 more +2

Research Article
10
10.1016/j.akcej.2018.07.003

F index of graphs based on four new operations related to the strong product

Aug 14, 2018
AKCE International Journal of Graphs and Combinatorics
D Sarala + 3 more +3

For a molecular graph, the first Zagreb index of a graph is equal to the sum of squares of the vertex degrees of the graph and the forgotten topological index (F-index) of a graph is defined as the sum of cubes of the vertex degrees of the graph. These parameters have applications in chemistry and drug structures. In this paper, we study the F index of strong product of two connected graphs in which one of the graphs is obtained by using four new sums called F sums of graphs and the other is any connected graph.

Research Article
3
10.1016/j.akcej.2018.06.005

Binomial trees are graceful

Jun 23, 2018
AKCE International Journal of Graphs and Combinatorics
P Ragukumar + 1 more +1

The binomial tree B0 consists of a single vertex. The binomial tree Bk is an ordered tree defined recursively. The binomial tree Bk consists of two binomial trees Bk−1 that are linked together: the root of one is the leftmost child of the root of the other. The popular Graceful Tree Conjecture states that every tree is graceful. In this paper, we show that binomial trees Bk is graceful for every k≥0.

Research Article
123
10.1016/j.akcej.2018.05.002

Beyond the Zagreb indices

Jun 19, 2018
AKCE International Journal of Graphs and Combinatorics
Ivan Gutman + 2 more +2

The two Zagreb indices M1=∑vd(v)2 and M2=∑uvd(u)d(v) are vertex-degree-based graph invariants that have been introduced in the 1970s and extensively studied ever since. In the last few years, a variety of modifications of M1 and M2 were put forward. The present survey of these modified Zagreb indices outlines their main mathematical properties, and provides an exhaustive bibliography.

Research Article
9
10.1016/j.akcej.2018.01.008

formula omitted]-super antimagic total labeling of comb product of graphs

Feb 13, 2018
AKCE International Journal of Graphs and Combinatorics
Ika Hesti Agustin + 2 more +2

Research Article
5
10.1016/j.akcej.2018.01.015

Some properties of 2-absorbing primary ideals in lattices

Feb 02, 2018
AKCE International Journal of Graphs and Combinatorics
Meenakshi P Wasadikar + 1 more +1

Research Article
1
10.1016/j.akcej.2018.01.010

Generalized projections in [formula omitted

Feb 01, 2018
AKCE International Journal of Graphs and Combinatorics
A.s Khairnar + 1 more +1

Research Article
4
10.1016/j.akcej.2017.12.003

Effect of vertex deletion on the weak Roman domination number of a graph

Jan 05, 2018
AKCE International Journal of Graphs and Combinatorics
P Roushini Leely Pushpam + 1 more +1

Research Article
7
10.1016/j.akcej.2017.09.001

Client–server and cost effective sets in graphs

Dec 14, 2017
AKCE International Journal of Graphs and Combinatorics
Mustapha Chellali + 2 more +2