In this paper, we present a graph-based analysis of the topology of D-Wave quantum computers, focusing on the Pegasus, Chimera, and Zephyr architectures. We investigate these topologies under different parameter settings using k-hop-based graph metrics. Each of these architectures comprises distinct subgraphs in which qubits are interconnected according to specific patterns dictated by their implementation. Our study pursues two primary objectives. First, we analyze the structural properties of the Chimera, Pegasus, and Zephyr topologies, examining their scalability and connectivity characteristics. Second, we evaluate the behavior of graph-based density and redundancy metrics within these architectures. The inherent symmetries of these quantum hardware designs provide a unique opportunity to systematically assess the effectiveness of these metrics across varying connectivity patterns. By leveraging these symmetries, our findings not only enhance the understanding of these topological structures but also offer deeper insights into the reliability and applicability of the proposed metrics in the broader context of quantum hardware design.
In this paper, we introduce the notion of resolvable networks. A resolvable network is a digraph of subnetworks, where subnetworks may overlap, and the inner structure of subnetworks are not interesting from the viewpoint of the network. There are two special subnetworks, Source and Sink, with the following properties: there is no incoming edge to Source, and there is no outgoing edge from Sink. Any resolvable network can be represented by a satisfiability problem in Boolean logic (shortly, SAT problem), and any SAT problem can be represented by a resolvable network. Because of that, the resolution operation is valid also for resolvable networks. We can use resolution to find out or refine the inner structure of subnetworks. We give also a pessimistic and an optimistic interpretation of subnetworks. In the pessimistic case, we assume that inside a subnetwork, all communication possibilities are represented as part of the resolvable network. In the optimistic case, we assume that each subnetwork is strongly connected. We show that any SAT problem can be visualized using the pessimistic interpretation. We show that transitivity is very limited in the pessimistic interpretation, and in this case, transitivity corresponds to resolution of clauses. In the optimistic interpretation of subnetworks, we have transitivity without any further condition, but not all SAT problems can be represented in this case; however, any such network can be represented as a SAT problem. The newly introduced graphical concept allows to use terminology and tools from directed graphs in the field of SAT and also to give graphical representations of various concepts of satisfiability problems. A resolvable network is also a suitable data structure to study, for example, wireless sensor networks. The visualization power of resolvable networks is demonstrated on some pigeon hole SAT problems. Another important application field could be modeling the communication network of an information bank. Here, a subnetwork represents a dataset of a user which is secured by a proxy. Any communication should be done through the proxy, and this constraint can be checked using our model.
In a previous paper we defined the black and white SAT problem which has exactly two solutions, where each variable is either true or false. We showed that black and white 2-SAT problems represent strongly connected directed graphs. We presented also the strong model of communication graphs. In this work we introduce two new models, the weak model, and the Balatonboglár model of communication graphs. A communication graph is a directed graph, where no self loops are allowed. In this work we show that the weak model of a strongly connected communication graph is a black and white SAT problem. We prove a powerful theorem, the so called transitions theorem. This theorem states that for any model which is between the strong and the weak model, we have that this model represents strongly connected communication graphs as black and white SAT problems. We show that the Balatonboglár model is between the strong and the weak model, and it generates 3-SAT problems, so the Balatonboglár model represents strongly connected communication graphs as black and white 3-SAT problems. Our motivation to study these models is the following: The strong model generates a 2-SAT problem from the input directed graph, so it does not give us a deep insight how to convert a general SAT problem into a directed graph. The weak model generates huge models, because it represents all cycles, even non-simple cycles, of the input directed graph. We need something between them to gain more experience. From the Balatonboglár model we learned that it is enough to have a subset of a clause, which represents a cycle in the weak model, to make the Balatonboglár model more compact. We still do not know how to represent a SAT problem as a directed graph, but this work gives a strong link between two prominent fields of formal methods: the SAT problem and directed graphs.
Two hybrid, entropy-guided node metrics are proposed for the k-hop environment: Entropy-Weighted Redundancy (EWR) and Normalized Entropy Density (NED). The central idea is to couple local Shannon entropy with neighborhood density/redundancy so that structural heterogeneity around a vertex is captured even when classical indices (e.g., degree or clustering) are similar. The metrics are formally defined and shown to be bounded, isomorphism-invariant, and stable under small edge edits. Their behavior is assessed on representative topologies (Erdős–Rényi, Barabási–Albert, Watts–Strogatz, random geometric graphs, and the Zephyr quantum architecture). Across these settings, EWR and NED display predominantly negative correlation with degree and provide information largely orthogonal to standard centralities; vertices with identical degree can differ by factors of two to three in the proposed scores, revealing bridges and heterogeneous regions. These properties indicate utility for vulnerability assessment, topology-aware optimization, and layout heuristics in engineered and quantum networks.
1 January 2026 in Journal of Computer Networks and Communications
OpenFlow, a key data plane protocol in software‐defined networking (SDN), relies heavily on ternary content addressable memory (TCAM) to achieve high‐speed packet matching. However, as OpenFlow evolves to support a broader set of match fields, the demand for TCAM storage grows significantly due to its support for arbitrary wildcards. To address this challenge, this paper introduces DECTCAM, a mathematical model designed to decrease TCAM space consumption without compromising OpenFlow’s flexibility or functionality. DECTCAM identifies and classifies redundancies across match fields into three distinct types and applies tailored compression strategies interfield merging, field mapping, and intrafield compression to optimize flow entry representations. These techniques produce more compact flow entries, which are then deployed to TCAM for efficient matching. Simulation results demonstrate that DECTCAM can decrease TCAM usage by nearly 78%, with consistent performance even as the flow table scales, all while preserving the original behavior of the OpenFlow rules.