On the public citation graph

Linearly many faults in arrangement graphs

0 signed · 56 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.1002/1097-0037(200103)37:2<84::aid-net3>3.0.co;2-aopenalex-snapshot

Embedding longest fault-free paths in arrangement graphs with faulty vertices

inferredcites →https://doi.org/10.1002/net.10045openalex-snapshot

Increasing the connectivity of the star graphs

inferredcites →https://doi.org/10.1002/net.20319openalex-snapshot

Linearly many faults in 2‐tree‐generated networks

inferredcites →https://doi.org/10.1002/net.3230230414openalex-snapshot

A new class of interconnection networks based on the alternating group

inferredcites →https://doi.org/10.1007/bfb0067376openalex-snapshot

On the cyclic connectivity of planar graphs

inferredcites →https://doi.org/10.1007/s11227-008-0242-9openalex-snapshot

Optimal fault-tolerant Hamiltonicity of star graphs with conditional edge faults

inferredcites →https://doi.org/10.1016/0020-0190(92)90030-yopenalex-snapshot

Arrangement graphs: a class of generalized star graphs

inferredcites →https://doi.org/10.1016/j.amc.2006.11.085openalex-snapshot

Restricted connectivity for three families of interconnection networks

inferredcites →https://doi.org/10.1016/j.amc.2007.08.073openalex-snapshot

Panpositionable hamiltonicity and panconnectivity of the arrangement graphs

inferredcites →https://doi.org/10.1016/j.disc.2004.11.004openalex-snapshot

Cuts leaving components of given minimum order

inferredcites →https://doi.org/10.1016/j.ins.2007.05.034openalex-snapshot

Linearly many faults in Cayley graphs generated by transposition trees

inferredcites →https://doi.org/10.1016/j.tcs.2005.01.018openalex-snapshot

Embedding longest fault-free paths onto star graphs with more vertex faults

inferredcites →https://doi.org/10.1016/s0020-0190(98)00052-0openalex-snapshot

On the arrangement graph

inferredcites →https://doi.org/10.1016/s0021-9800(70)80005-9openalex-snapshot

Connectivity of transitive graphs

inferredcites →https://doi.org/10.1016/s0096-3003(02)00223-0openalex-snapshot

Super-connectivity and super-edge-connectivity for some interconnection networks

inferredcites →https://doi.org/10.1016/s0304-3975(00)00190-0openalex-snapshot

Longest fault-free paths in star graphs with vertex faults

inferredcites →https://doi.org/10.1080/00207160410001661726openalex-snapshot

On the maximal connected component of hypercube with faulty vertices

inferredcites →https://doi.org/10.1080/00207160500113173openalex-snapshot

On the maximal connected component of a hypercube with faulty vertices III

inferredcites →https://doi.org/10.1080/17445760.2011.650696openalex-snapshot

Extra edge connectivity of hypercube-like networks

inferredcites →https://doi.org/10.1109/12.238494openalex-snapshot

Embedding of cycles in arrangement graphs

inferredcites →https://doi.org/10.1109/12.954510openalex-snapshot

Longest fault-free paths in star graphs with edge faults

inferredcites →https://doi.org/10.1109/71.755822openalex-snapshot

Fault-free Hamiltonian cycles in faulty arrangement graphs

inferredcites →https://doi.org/10.1109/icpp.1993.76openalex-snapshot

Embedding Grids, Hypercubes, and Trees in Arrangement Graphs

inferredcites →https://doi.org/10.1109/tc.2004.1255789openalex-snapshot

Fault Hamiltonicity and fault Hamiltonian connectivity of the arrangement graphs

inferredcites →https://doi.org/10.1142/s0129054107005108openalex-snapshot

FAULT RESILIENCY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITIONS

inferredcites →https://doi.org/10.7155/jgaa.00005openalex-snapshot

A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1002/jgt.22690openalex-snapshot

The symmetry property of (n,k)‐arrangement graph

inferred← citeshttps://doi.org/10.1007/978-3-031-05375-7_20openalex-snapshot

On the Extraconnectivity of Arrangement Graphs

inferred← citeshttps://doi.org/10.1007/s11227-017-1964-3openalex-snapshot

On the restricted connectivity of the arrangement graph

inferred← citeshttps://doi.org/10.1016/j.amc.2021.126845openalex-snapshot

Note on reliability evaluation of arrangement graphs

inferred← citeshttps://doi.org/10.1016/j.jpdc.2022.08.003openalex-snapshot

Reliability of arrangement networks in terms of the h-restricted edge connectivity

inferred← citeshttps://doi.org/10.1016/j.laa.2013.11.035openalex-snapshot

On the eigenvalues of certain Cayley graphs and arrangement graphs

inferred← citeshttps://doi.org/10.1016/j.laa.2015.01.006openalex-snapshot

Cayley graph on symmetric group generated by elements fixing k points

inferred← citeshttps://doi.org/10.1016/j.tcs.2018.07.018openalex-snapshot

A general approach to deriving the g-good-neighbor conditional diagnosability of interconnection networks

inferred← citeshttps://doi.org/10.1016/j.tcs.2020.09.042openalex-snapshot

Linearly many faults in Cayley graphs generated by transposition triangle free unicyclic graphs

inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114927openalex-snapshot

Enabling high reliability via matroidal connectivity and conditional matroidal connectivity on arrangement graph networks

inferred← citeshttps://doi.org/10.1080/00207160.2016.1148813openalex-snapshot

On extra connectivity and extra edge-connectivity of balanced hypercubes

inferred← citeshttps://doi.org/10.1080/17445760.2019.1600688openalex-snapshot

Diagnosability of arrangement graphs with missing edges under the MM* model

inferred← citeshttps://doi.org/10.1080/17445760.2019.1655742openalex-snapshot

Diagnosability of interconnection networks: past, present and future

inferred← citeshttps://doi.org/10.1080/17445760.2022.2060977openalex-snapshot

A general approach to deriving diagnosability results of interconnection networks*

inferred← citeshttps://doi.org/10.1080/23799927.2020.1764626openalex-snapshot

The g -extra diagnosability of the generalized exchanged hypercube

inferred← citeshttps://doi.org/10.1093/comjnl/bxac006openalex-snapshot

Component Fault Diagnosis and Fault Tolerance of Alternating Group Graphs

inferred← citeshttps://doi.org/10.1093/comjnl/bxz088openalex-snapshot

Note on Applications of Linearly Many Faults

inferred← citeshttps://doi.org/10.1109/i-span.2012.15openalex-snapshot

On the Conditional Diagnosability of Cayley Graphs Generated by 2-trees and Related Networks

inferred← citeshttps://doi.org/10.1109/tdsc.2017.2726541openalex-snapshot

Relating Extra Connectivity and Extra Conditional Diagnosability in Regular Networks

inferred← citeshttps://doi.org/10.1109/tr.2015.2413372openalex-snapshot

The Reliability of Subgraphs in the Arrangement Graph

inferred← citeshttps://doi.org/10.1109/tr.2021.3066185openalex-snapshot

An Analysis on the Reliability of the Alternating Group Graph

inferred← citeshttps://doi.org/10.1109/tr.2023.3301629openalex-snapshot

Probabilistic Reliability via Subsystem Structures of Arrangement Graph Networks

inferred← citeshttps://doi.org/10.1142/s0129054125500169openalex-snapshot

The g -Extra Mixed Connectivity of Hypercube-Like Networks

inferred← citeshttps://doi.org/10.1142/s0129626420400095openalex-snapshot

A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks

inferred← citeshttps://doi.org/10.1142/s0219265916500043openalex-snapshot

Strong Matching Preclusion of Arrangement Graphs

inferred← citeshttps://doi.org/10.1142/s0219265921500158openalex-snapshot

Connectivity Properties of Generalized K4-Hypercubes

inferred← citeshttps://doi.org/10.1142/s0219265921500389openalex-snapshot

Distance Optimally Edge Connectedness of Arrangement Graph Based on Subgraph Fault Pattern

inferred← citeshttps://doi.org/10.3390/info9110275openalex-snapshot

g-Good-Neighbor Diagnosability of Arrangement Graphs under the PMC Model and MM* Model

inferred← citeshttps://doi.org/10.3390/math12020268openalex-snapshot

A Validation of the Phenomenon of Linearly Many Faults on Burnt Pancake Graphs with Its Applications

inferred← citeshttps://doi.org/10.37236/3711openalex-snapshot

Cyclic Decomposition of $k$-Permutations and Eigenvalues of the Arrangement Graphs

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.