AKCE International Journal of Graphs and Combinatorics is devoted to publication of standard original research papers in Combinatorial Mathematics and related areas. The fields covered by the journal include:    Graphs and hypergraphs,  Network theory,  Combinatorial optimization,  Coding theory,  Block designs,  Combinatorial geometry,  Matroid theory,  Logic,  Computing,  Neural networks and any related topics.    Each volume will consist of three issues to be published in the months of April, August and December every year. Contribution presented to the journal can be Full-length article, Review article, Short communication and about a conference. The journal will also publish proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standard of the journal.

The AKCE International Journal of Graphs and Combinatorics is dedicated to the publication of standard original research papers in Combinatorial Mathematics and related areas. The fields covered by the journal include: graphs and hypergraphs, network theory, combinatorial optimization, coding theory, block designs, combinatorial geometry, matroid theory, logic, computing, neural networks, and any related topics. Each volume will consist of three issues published in April, August, and December each year. Contributions to the journal can include full-length articles, review articles, short communications, and conference-related content. The journal will also publish proceedings of conferences, which will be fully refereed and adhere to the journal's normal standards.

《AKCE国际图论与组合数学期刊》致力于发表组合数学及相关领域的标准原创研究论文。期刊涵盖的领域包括：图与超图、网络理论、组合优化、编码理论、区块设计、组合几何、矩阵理论、逻辑、计算、神经网络及任何相关主题。每卷将包含三期，分别于每年的四月、八月和十二月出版。向期刊提交的贡献可以是完整的研究文章、综述文章、简短通讯或会议相关内容。期刊还将出版会议论文集，这些论文集将经过严格的审稿，并遵循期刊的正常标准。

AKCE International Journal of Graphs and Combinatorics

Let H be a set of given connected graphs. A graph G is said to be H-free if G contains no H as an induced subgraph for any H∈H. The graph G is super-edge-connected if each minimum edge-cut isolates a vertex in G. In this paper, except for some special graphs, we characterize all forbidden subgraph sets H such that every H-free graph is super-edge-connected for |H|=1 and 2.

Hazhe Ye

Yingzhi Tian

Characterizing the forbidden pairs for graphs to be super-edge-connected

刻画图成为超边连通图的禁用对

The second status connectivity index (SSC index, for short) of a simple connected graph A is defined as the sum of the terms σA(a)σA(b) over all edges ab of A, where σA(a), the status of a vertex a in A, is the sum of the distances between a and all other vertices of A. The aim of the paper is to study the SSC index through investigating its behavior under various families of composite graphs and a number of mathematico-chemically interesting graphs derived from them.

Mahdieh Azari

Jia-Bao Liu

Further study on the second status connectivity index of graphs

图的第二状态连通性指数的进一步研究

A topological index is a graph invariant applicable in chemistry. The first Zagreb index is a topological index based on the vertex degrees of molecular graphs. For any graph G, the first Zagreb index M1(G) is equal to the sum of squares of the degrees of vertices. A block in a graph G is a maximal connected subgraph of G which has no cut-vertices. Two vertices u,w∈V(G) are said to be vv-adjacent if they incident on the same block. The vv-degree of a vertex u is the number of vertices vv-adjacent to u. In this paper, we introduce a vv-degree based graph invariant, named the first vv-Zagreb index VVM1(G), and obtain lower and upper bounds on VVM1(G) in terms of the number of vertices, number of blocks, and maximum vv-degree of G using some classical inequalities. Further, we compute the first vv-block Zagreb index for the silicate network and the silicate chain network.

L. Anusha

N. V. Sayinath Udupa

N. Prathviraj

On the vv-degree based first Zagreb index of graphs

关于基于vv-度的图的第一Zagreb指数

A. Rajabi

A. Erfanian

On endomorphism-regularity of ( n , n + 1)-graphs

关于( n , n + 1)-图的自同态正则性

The computation of the clique number of a graph is a fundamental problem in graph theory, which has many applications in computational chemistry, bioinformatics, computer, and social networking. A subset S of non-negative integers N0 is called a numerical semigroup if it is a submonoid of N0 and has a finite complement in N0. The graph associated with numerical semigroup S is denoted by G[S] and is defined by the vertex set {x:x∈g(S)} and the edge set {xy ⇔ x+y∈S}. In this article, we compute the clique number and the minimum degree of those graphs, which can be associated with symmetric numerical semigroups of embedding dimension 2. Moreover, on this basis, we give some bounds for the atom-bond sum-connective index of graphs G[S] in terms of the harmonic index, the first Zagreb index, the sum-connectivity index, the maximum degree, the minimum degree, the chromatic number, and the clique number.

Ying Wang

Anam Shahzadi

Muhammad Ahsan Binyamin

Maria Mehtab

Fairouz Tchier

Adnan Aslam

On bounds for the atom bond sum connectivity index of graphs associated with symmetric numerical semigroups

关于与对称数值半群相关的图的键和连通性指数的界

S. C. Manju

K. Somasundaram

Yilun Shang

A new method for computing the vertex PI index with applications to special classes of graphs

一种计算顶点PI指数的新方法及其在特殊图类中的应用

Abbreviation	AKCE Int. J. Graphs Comb.
Journal Impact	1.04
Quartiles(Global)	MATHEMATICS, APPLIED(Q3)

ISSN	0972-8600, 2543-3474
h-index	20

Publication Information	Publisher: Taylor and Francis Ltd.，Publishing cycle: ，Journal Type: journal，Open Access Journals: Yes
Basic data	Year of publication: 2011，Proportion of original research papers: 100.00%，Self Citation Rate:10.00%， Gold OA Rate: 90.28%
Journal Fees	$1680Details
Average review cycle	28 weeks

AKCE International Journal of Graphs and Combinatorics

Journal Citation Format

A journal article with 1 author

A journal article with 2 authors

A journal article with 3 authors

A journal article with 5 or more authors

Books Citation Format

Thesis Citation Format

Web sites Citation Format

Patent Citation Format

Staying up late manually editing references? ivySCI automatically matches journals and helps you generate references with a single click.

Share Submission Experience

Characterizing the forbidden pairs for graphs to be super-edge-connected

Further study on the second status connectivity index of graphs

On the vv-degree based first Zagreb index of graphs

On endomorphism-regularity of ( n , n + 1)-graphs

On bounds for the atom bond sum connectivity index of graphs associated with symmetric numerical semigroups

On endomorphism-regularity of ( n , n + 1)-graphs

Further study on the second status connectivity index of graphs

On the vv-degree based first Zagreb index of graphs

Characterizing the forbidden pairs for graphs to be super-edge-connected

A new method for computing the vertex PI index with applications to special classes of graphs