1.

Record Nr.

UNISA996392374703316

Titolo

The articles of agreement between the King of France, the Parliament, and Parisians [[electronic resource] ] : With a list of the names of those who signed thereunto, on the King's, Parliaments, and Citizens behalfe. / / Faithfully translated out of the French originall copy, by G. Le Moyne

Pubbl/distr/stampa

London, : Printed for H.S., 1649

Descrizione fisica

[2], 6 p

Altri autori (Persone)

Louis, King of France,  <1638-1715.>

Soggetti

France History Louis XIV, 1643-1715 Early works to 1800

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

Annotation on Thomason copy: "March 16. 1648".

Reproduction of the original in the British Library.

Sommario/riassunto

eebo-0018



2.

Record Nr.

UNINA9910673903003321

Titolo

Discrete Mathematics and Symmetry / / edited by Angel Garrido

Pubbl/distr/stampa

Basel : , : MDPI - Multidisciplinary Digital Publishing Institute, , 2020

Descrizione fisica

1 online resource (458 pages) : illustrations

Disciplina

516.1

Soggetti

Symmetry (Mathematics)

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Nota di bibliografia

Includes bibliographical references.

Sommario/riassunto

Some of the most beautiful studies in Mathematics are related to Symmetry and Geometry. For this reason, we select here some contributions about such aspects and Discrete Geometry. As we know, Symmetry in a system means invariance of its elements under conditions of transformations. When we consider network structures, symmetry means invariance of adjacency of nodes under the permutations of node set. The graph isomorphism is an equivalence relation on the set of graphs. Therefore, it partitions the class of all graphs into equivalence classes. The underlying idea of isomorphism is that some objects have the same structure if we omit the individual character of their components. A set of graphs isomorphic to each other is denominated as an isomorphism class of graphs. The automorphism of a graph will be an isomorphism from G onto itself. The family of all automorphisms of a graph G is a permutation group.