A new class of symmetric functions.
A New Class of Tilings with Two Prototiles
A new combinatorial identity.
A new construction for cancellative families of sets.
A new construction of the block systems B(4,1,25) and B(4,1, 28)
A new determinant expression of the zeta function for a hypergraph.
A new domino tiling sequence.
A new estimate for the vertex number of an edge-regular graph.
A new generating function of (-) Bernstein-type polynomials and their interpolation function.
A new like quantity based on “Estrada index”.
A new lower bound for the inducibility of a graph
A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid.
A New Method for Computing the Eccentric Connectivity Index of Fullerenes
ACM Computing Classification System (1998): G.2.2, G.2.3.The eccentric connectivity index of the molecular graph G, ξ^c (G), was proposed by Sharma, Goswami and Madan. It is defined as ξ^c (G) = Σu∈V(G)degG(u) ecc(u), where degG(x) denotes the degree of the vertex x in G and ecc(u) = Max{d(x, u) | x ∈ V (G)}. In this paper this graph invariant is computed for an infinite class of fullerenes by means of group action.
A new method to construct lower bounds for van der Waerden numbers.
A New Necessary Condition for the Vertex Visibility Graphs of Simple Polygons.
A new proof of a characterization of the set of all geodesics in a connected graph
A new proof of a theorem of Dirac on the number of edges in critical graphs.
A new proof of some identities of Bressoud.
A new proof of the four-colour theorem.
A new proof of the -Dixon identity
We give a new and elementary proof of Jackson’s terminating -analogue of Dixon’s identity by using recurrences and induction.