{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q1302152","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q1302152","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q1302152","kernelVersion":"v1","immutable":true,"modified":"2025-12-25T09:02:35Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q1302152","name":"On \\(k\\)-partitioning of Hamming graphs","headline":"On \\(k\\)-partitioning of Hamming graphs","description":"scientific article; zbMATH DE number 1340631","url":"https://portal.mardi4nfdi.de/entity/Q1302152","datePublished":"2000-04-09","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q169301"},{"@id":"https://portal.mardi4nfdi.de/entity/Q187114"},{"@id":"https://portal.mardi4nfdi.de/entity/Q391756"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q96294"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/S0166-218X(99)00070-0","url":"https://doi.org/10.1016/S0166-218X(99)00070-0"},"sameAs":["https://doi.org/10.1016/S0166-218X(99)00070-0"],"comment":"For a graph \\(G=(V,E)\\) a \\(k\\)-partition is a partition \\(A=\\{A_1, A_2, \\dots, A_k \\}\\) of \\(V\\) such that \\(||A_i|- |A_j||\\leq 1\\) for all \\(i,j\\in \\{1,2,\\dots, k\\}\\). A cut of partition \\(A\\) is a set of edges having ends in different sets of the partition. The authors investigate the problem of determining \\(k\\)-partitions with minimal cardinality cut. Several interesting bounds and asymptotic results for some specific values of \\(k\\) are presented for Hamming graphs (Cartesian products of complete graphs)."},"provenance":{"prov:generatedAtTime":"2025-12-25T09:02:35Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}