On the public citation graph

On Bipartite Circulant Graph Decompositions Based on Cartesian and Tensor Products with Novel Topologies and Deadlock-Free Routing

https://doi.org/10.3390/a16010010
0 signed · 50 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jpdc.1995.1002openalex-snapshot
Distributed Loop Computer-Networks: A Survey
inferredcites →https://doi.org/10.1007/3-540-49381-6_32openalex-snapshot
Hamiltonian Decomposition of Recursive Circulants
inferredcites →https://doi.org/10.1007/978-94-011-1202-4openalex-snapshot
Graph Theoretical Approaches to Chemical Reactivity
inferredcites →https://doi.org/10.1007/s00453-001-0043-5openalex-snapshot
All-to-All Optical Routing in Chordal Rings of Degree 4
inferredcites →https://doi.org/10.1007/s11036-019-01262-2openalex-snapshot
SCCN: A Time-Effective Hierarchical Interconnection Network for Network-On-Chip
inferredcites →https://doi.org/10.1007/s11227-022-04396-5openalex-snapshot
Optimal circulant graphs as low-latency network topologies
inferredcites →https://doi.org/10.1016/0012-365x(84)90096-7openalex-snapshot
Research problems
inferredcites →https://doi.org/10.1016/0095-8956(89)90040-3openalex-snapshot
Hamiltonian decomposition of Cayley graphs of degree 4
inferredcites →https://doi.org/10.1016/0169-7552(86)90027-9openalex-snapshot
A survey of multi-connected loop topologies for local computer networks
inferredcites →https://doi.org/10.1016/j.aej.2022.01.049openalex-snapshot
On the decomposition of circulant graphs using algorithmic approaches
inferredcites →https://doi.org/10.1016/j.aej.2022.04.022openalex-snapshot
On infinite circulant-balanced complete multipartite graphs decompositions based on generalized algorithmic approaches
inferredcites →https://doi.org/10.1016/j.heliyon.2019.e01516openalex-snapshot
Development of routing algorithms in networks-on-chip based on ring circulant topologies
inferredcites →https://doi.org/10.1016/j.ipl.2009.05.011openalex-snapshot
Lucky labelings of graphs
inferredcites →https://doi.org/10.1016/j.physa.2006.04.047openalex-snapshot
Bipartite graphs as models of complex networks
inferredcites →https://doi.org/10.1016/j.sysarc.2016.04.011openalex-snapshot
NoC routing protocols – objective-based classification
inferredcites →https://doi.org/10.1016/s0166-218x(99)00143-2openalex-snapshot
Counting symmetric configurations v3
inferredcites →https://doi.org/10.1016/s0167-5060(08)70053-0openalex-snapshot
Decomposing Complete Graphs Into Cycles of Length 2P
inferredcites →https://doi.org/10.1016/s0304-3975(00)00243-7openalex-snapshot
A complementary survey on double-loop networks
inferredcites →https://doi.org/10.1016/s0304-3975(01)00341-3openalex-snapshot
A survey on multi-loop networks
inferredcites →https://doi.org/10.1021/ja00842a001openalex-snapshot
Theory of chemical reaction networks. All possible mechanisms or synthetic pathways with given number of reaction steps or species
inferredcites →https://doi.org/10.1038/340245a0openalex-snapshot
A novel genetic system to detect protein–protein interactions
inferredcites →https://doi.org/10.1038/35001009openalex-snapshot
A comprehensive analysis of protein–protein interactions in Saccharomyces cerevisiae
inferredcites →https://doi.org/10.1038/35051615openalex-snapshot
The protein–protein interaction map of Helicobacter pylori
inferredcites →https://doi.org/10.1038/nrg2484openalex-snapshot
RNA-Seq: a revolutionary tool for transcriptomics
inferredcites →https://doi.org/10.1073/pnas.061034498openalex-snapshot
A comprehensive two-hybrid analysis to explore the yeast protein interactome
inferredcites →https://doi.org/10.1073/pnas.080078197openalex-snapshot
Genome-wide analysis of vaccinia virus protein–protein interactions
inferredcites →https://doi.org/10.1080/09720529.2021.1885806openalex-snapshot
On some applications related with algebraic structures through different well known graphs
inferredcites →https://doi.org/10.1093/embo-reports/kve184openalex-snapshot
A protein–protein interaction map of the Caenorhabditis elegans 26S proteasome
inferredcites →https://doi.org/10.1109/access.2021.3095146openalex-snapshot
The Static Performance Effect of Hybrid- Hierarchical Interconnection by Shifted Completely Connected Network
inferredcites →https://doi.org/10.1109/hcs52781.2021.9566904openalex-snapshot
Accelerating ML Recommendation with over a Thousand RISC-V/Tensor Processors on Esperanto’s ET-SoC-1 Chip
inferredcites →https://doi.org/10.1109/icieam54945.2022.9787143openalex-snapshot
The New Promising Network-on-Chip Topologies Development Using Hierarchical Method
inferredcites →https://doi.org/10.1109/proc.1972.8647openalex-snapshot
The Illiac IV system
inferredcites →https://doi.org/10.1109/rusautocon52004.2021.9537317openalex-snapshot
The New Promising Network-on-Chip Topologies Development Using Product Operation
inferredcites →https://doi.org/10.1109/sc41405.2020.00062openalex-snapshot
Fast Stencil-Code Computation on a Wafer-Scale Processor
inferredcites →https://doi.org/10.1109/tcom.1972.1091214openalex-snapshot
Analysis and Design of Reliable Computer Networks
inferredcites →https://doi.org/10.1109/tnse.2022.3211985openalex-snapshot
Routing Algorithms in Optimal Degree Four Circulant Networks Based on Relative Addressing: Comparative Analysis for Networks-on-Chip
inferredcites →https://doi.org/10.1109/tvlsi.2019.2959618openalex-snapshot
Formal Modeling of Network-on-Chip Using CFSM and its Application in Detecting Deadlock
inferredcites →https://doi.org/10.1186/1756-0381-4-10openalex-snapshot
Using graph theory to analyze biological networks
inferredcites →https://doi.org/10.1515/chem-2019-0007openalex-snapshot
Zagreb Connection Number Index of Nanotubes and Regular Hexagonal Lattice
inferredcites →https://doi.org/10.1515/math-2020-0003openalex-snapshot
On applications of bipartite graph associated with algebraic structures
inferredcites →https://doi.org/10.15244/pjoes/75961openalex-snapshot
Role of Graph Theory to Facilitate Landscape Connectivity: Subdivision of a Harary Graph
inferredcites →https://doi.org/10.21577/0100-4042.20160173openalex-snapshot
Molecular descriptors of benzenoid systems
inferredcites →https://doi.org/10.3390/molecules22091496openalex-snapshot
Topological Characterization of Carbon Graphite and Crystal Cubic Carbon Structures
inferredcites →https://doi.org/10.5808/gi.2013.11.4.200openalex-snapshot
Review of Biological Network Data and Its Applications

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4837079openalex-extracted
The Independent Set Problem on Circulant Graphs Cn(A,B)
inferred← citeshttps://doi.org/10.1016/j.dam.2026.02.005openalex-snapshot
The Maximum Independent Set problem on circulant graphs C n ( a , b )
inferred← citeshttps://doi.org/10.1155/2024/9131329openalex-snapshot
Explicit Formulas for the Complexity of Networks Produced by New Duplicating Corona and Cartesian Product
inferred← citeshttps://doi.org/10.3390/a16070320openalex-snapshot
On Orthogonal Double Covers and Decompositions of Complete Bipartite Graphs by Caterpillar Graphs
inferred← citeshttps://doi.org/10.3390/appliedmath5020032openalex-snapshot
Failed Skew Zero Forcing Numbers of Path Powers and Circulant Graphs
inferred← citeshttps://doi.org/10.3390/fi15050183openalex-snapshot
Distributed Average Consensus Algorithms in d-Regular Bipartite Graphs: Comparative Study
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.