期刊： AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2020; 17 (2)
A graph is supereulerian if it has a spanning closed trail. Catlin in 1990 raised the problem of determining the reduced nonsupereulerian graphs with ......
期刊： AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2020; 17 (1)
A multicone graph is defined to be the join of a clique and a regular graph. Let w, n and m be natural numbers, and let Kw and Kn,n denote a complete ......
期刊： AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2020; 17 (1)
We determine the number of cycles of different lengths in the minimum fundamental cycle basis of some bipartite graphs with centralized spanning trees......
期刊： AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2020; 17 (1)
We give a new proof of the theorem of Boesch-Tindell and Farzad-Mahdian-Mahmoodian-Saberi-Sadri that a directed graph extends to a strongly connected ......
期刊： AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2020; 17 (1)
For a graph G and a set F of connected graphs, G is said be F-free if G does not contain any member of F as an induced subgraph. For k >= 3, we let......
期刊： AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2020; 17 (1)
Let G be a simple connected graph. The hyper-Zagreb index is defined as HM(G)=Sigma uv is an element of E(G)(dG(u)+dG(v))2. A connected graph G is a c......
期刊： AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2020; 17 (1)
In this study we investigate the spectra of the family of connected multicone graphs. A multicone graph is defined to be the join of a clique and a re......
期刊： AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2020; 17 (1)
A graph G is said to be borderenergetic (L-borderenergetic, respectively) if its energy (Laplacian energy, respectively) equals the energy (Laplacian ......
期刊： AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2020; 17 (1)
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 topologic......
期刊： AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2020; 17 (3)
Bollobas and Scott conjectured that every graph G has a balanced bipartite spanning subgraph H such that for each v is an element of V(G),dH(v)>= (......
期刊： AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2020; 17 (3)
For two positive numbers d and m, an m-L(1, d)-labeling of a graph G is a mapping f:V(G)-> [0,m] such that |f(u)-f(v)|>= 1 if d(u,v)=1, and |f(u......
期刊： AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2020; 17 (3)
Let r >= 2 be an integer. A graph G=(V,E) is called r - partite if V admits a partition into r parts such that every edge has its ends in different......
期刊： AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2020; 17 (3)
System level diagnosis, an area pioneered by Preparata, Metze and Chien, has been a dominant area of research in the broader area of fault-tolerant co......
期刊： AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2020; 17 (3)
Given graphs G and H and a positive integer k, the Gallai-Ramsey number grk(G:H) is the minimum integer N such that for any integer n >= N, every k......
期刊： AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2020; 17 (3)
Considering the appointments that teachers plan to teach some courses for specific classes, the problem is to schedule the curriculum such that the ti......
