The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying 181 – 200 of 299

Showing per page

Graphes h - maximaux

M. Chein (1970)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Graphic algebras

Ladislav Nebeský (1970)

Commentationes Mathematicae Universitatis Carolinae

Graphic sequences of trees and a problem of Frobenius

Gautam Gupta, Puneet Joshi, Amitabha Tripathi (2007)

Czechoslovak Mathematical Journal

We give a necessary and sufficient condition for the existence of a tree of order n with a given degree set. We relate this to a well-known linear Diophantine problem of Frobenius.

Graphic Splitting of Cographic Matroids

Naiyer Pirouz (2015)

Discussiones Mathematicae Graph Theory

In this paper, we obtain a forbidden minor characterization of a cographic matroid M for which the splitting matroid Mx,y is graphic for every pair x, y of elements of M.

Graphs associated with nilpotent Lie algebras of maximal rank.

Eduardo Díaz, Rafael Fernández-Mateos, Desamparados Fernández-Ternero, Juan Núñez (2003)

Revista Matemática Iberoamericana

In this paper, we use the graphs as a tool to study nilpotent Lie algebras. It implies to set up a link betwcen graph theory and Lie theory. To do this, it is already known that every nilpotent Lie algebra of maximal rank is associated with a generalized Cartan matrix A and it ils isomorphic to a quotient of the positive part n+ of the KacMoody algebra g(A). Then, if A is affine, we can associate n+ with a directed graph (from now on, we use the term digraph) and we can also associate a subgraph...

Currently displaying 181 – 200 of 299