Simulating digital circuits with clique graphs

DOI10.21711/231766362020/RMC4619MaRDI QIDQ6492338zbMATH OpenFDO

Authors Carmen Cedillo, M. A. Pizaña

Publication date 25 April 2024

Published in Matemática Contemporânea (Search for Journal in Brave)

Full work available at URL https://doi.org/10.21711/231766362020/RMC4619

zbMATH Keywords

graph theoryclique graphsdecidabilitygraph dynamicsTuring-completeness

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• scientific article; zbMATH DE number 2096439
• The clique behavior of circulants with three small jumps.
• The clique operator on cographs and serial graphs
• On clique divergent graphs with linear growth
• The difference between clique graphs and iterated clique graphs

This page was built for publication: Simulating digital circuits with clique graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6492338)