Iskanje po katalogu digitalne knjižnice

Ključne besede: Szeged entropy, Mostar entropy, PI entropy, cut method, quotient graphs, sensitivity of a topological descriptor
Objavljeno v DKUM: 20.05.2024; Ogledov: 164; Prenosov: 15
Celotno besedilo (3,17 MB)
Gradivo ima več datotek! Več...

Opis: Cartesian products of complete graphs are known as Hamming graphs. Using embeddings into Cartesian products of quotient graphs we characterize subgraphs, induced subgraphs, and isometric subgraphs of Hamming graphs. For instance, a graph ▫$G$▫ is an induced subgraph of a Hamming graph if and only if there exist a labeling ▫$E(G)$▫ fulfilling the following two conditions: (i) incident edges receive the same label if and only if they lie on a common triangle; (ii) for any vertices ▫$u$▫ and ▫$v$▫ at distance at least two, there exist two labels such that they appear on any induced ▫$u,v$▫-path.
Ključne besede: matematika, teorija grafov, Hammingovi grafi, inducirani podgrafi, izometrični podgrafi, kartezični produkt grafov, označevanje povezav, kvocientni grafi, mathematics, graph theory, Hamming graphs, induced subgraphs, isometric subgraphs, edge-labelings, Cartesian products, quotient graphs
Objavljeno v DKUM: 10.07.2015; Ogledov: 1169; Prenosov: 81
Povezava na celotno besedilo