A list is given of all semisymmetric (edgebut not vertex-transitive) connected finite cubic graphs of order up to 768. This list was determined by the authors using Goldschmidtâ€™s classification ofâ€¦ (More)

We characterize Cayley graphs of abelian groupswhich admit a nowhere-zero 3-flow. In particular, we prove that every k-valent Cayley graph of an abelian group, where k 4, admits a nowhere-zero

In this paper we examine the orders of vertex-transitive self-complementary uniform hypergraphs. In particular, we prove that if there exists a vertex-transitive selfcomplementary k-uniformâ€¦ (More)

RandiÄ‡ index, R, also known as the connectivity or branching index, is an important topological index in chemistry. In order to attack some conjectures concerning RandiÄ‡ index, DvoÅ™Ã¡k et al. [5]â€¦ (More)

For a graph G, denote by L i (G) its i-iterated line graph and denote by W (G) its Wiener index. We prove that the function W (L i (G)) is convex in variable i. Moreover, this function is strictlyâ€¦ (More)

A graph X is called almost self-complementary with respect to a perfect matching I if it is isomorphic to the graph obtained from its complement Xc by removing the edges of I. A two-graph on a vertexâ€¦ (More)

A classification of strongly regular Cayley graphs of cyclic group was independently achieved by Bridges and Mena (Ars Combin. 8 (1979) 143), Hughes, van Lint and Wilson (Announcement at the Seventhâ€¦ (More)

A k-uniform hypergraph with vertex set V and edge set E is called t-subset-regular if every t-element subset of V lies in the same number of elements of E . In this paper we show that aâ€¦ (More)