Le costanti forti negli insiemi grafici parzialmente ordinati (GPO-SETS)


Let V be a set of "vertices". Let’s define an edge as follows: i) any vertex is an edge ii) any set of edges is an edge.Let’s define a set of edges as a "g-graph".By this definition we can generalize many graph-theoretic concepts.In this paper we study the properties of the "strong constants" [G,H], where such constants can be seen as the generalization to g-graphs of the graphtheoretic concept "number of graphs isomorphic with G that are induced subgraphs of H".

DOI Code: 10.1285/i15900932v3n2p281

Full Text: PDF

Creative Commons License
This work is licensed under a Creative Commons Attribuzione - Non commerciale - Non opere derivate 3.0 Italia License.