A generalized direct product of graphs.
A generalized formula of Hardy.
A generalized major index statistic.
A Generalized Mean-Value Theorem.
A generating function for fatgraphs
A generating functions proof of a curious identity.
A genus for N-dimensional knots and links.
A geometric approach to the almost convexity and growth of some nilpotent groups.
A geometric approach to universal quasigroup identities
In the present paper we construct the accompanying identity of a given quasigroup identity . After that we deduce the main result: is isotopically invariant (i.e., for every guasigroup it holds that if is satisfied in then is satisfied in every quasigroup isotopic to ) if and only if it is equivalent to (i.e., for every quasigroup it holds that in either are both satisfied or both not).
A Geometric Characterization of Moufang Hexagons.
A Geometric Construction of Janko's Group J... .
A geometric theory of hypergraph colouring.
A geometric version of the Kerov-Kirillov-Reshetikhin construction. (Une version géométrique de la construction de Kerov-Kirilov-Reshetikhin.)
A Gessel--Viennot-type method for cycle systems in a directed graph.
A graph and its complement with specified properties. I: Connectivity.
A graph and its complement with specified properties. III: Girth and circumference.
A graph associated to proper non-small ideals of a commutative ring
In this paper, a new kind of graph on a commutative ring is introduced and investigated. Small intersection graph of a ring , denoted by , is a graph with all non-small proper ideals of as vertices and two distinct vertices and are adjacent if and only if is not small in . In this article, some interrelation between the graph theoretic properties of this graph and some algebraic properties of rings are studied. We investigated the basic properties of the small intersection graph as diameter,...
A graph-based estimator of the number of clusters
Assessing the number of clusters of a statistical population is one of the essential issues of unsupervised learning. Given n independent observations X1,...,Xn drawn from an unknown multivariate probability density f, we propose a new approach to estimate the number of connected components, or clusters, of the t-level set . The basic idea is to form a rough skeleton of the set using any preliminary estimator of f, and to count the number of connected components of the resulting graph. Under...
A graphic generalization of arithmetic.
A graphical way to solve the Boolean matrix equations and