scientific article; zbMATH DE number 2010366

From MaRDI portal
Revision as of 03:49, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4435203

zbMath1046.68026MaRDI QIDQ4435203

Jun-Ming Xu

Publication date: 27 November 2003


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (only showing first 100 items - show all)

Some exact values for p(t, d)Minimum diameter and tF(f, q)Adaptive diagnosis for torus systems under the comparison modelAn asymptotic relation between the wirelength of an embedding and the Wiener indexRestricted connectivity of total digraphEmbedding complete multi-partite graphs into Cartesian product of paths and cyclesWiener index via wirelength of an embeddingDistance degree graphs in the Cartesian product of graphsConnectivity of the generalized hierarchical product of graphsINVERSE DOMINATION NUMBER OF CIRCULANT GRAPHStructure and Substructure Connectivity of Hypercube-Like NetworksOn the 3-Extra Connectivity of Enhanced HypercubesEmbedding Circulant Networks into Butterfly and Benes NetworksOptimal embedding of hypercube into cylinderNote on reliability of star graphsEmbedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycleTwo-disjoint-cycle-cover vertex pancyclicity of augmented cubesThe generalized 4-connectivity of locally twisted cubesThe disjoint path cover in the data center network HSDC with prescribed vertices in each pathOn k-restricted connectivity of direct product of graphsReliability analysis of 3-ary \(n\)-cube in terms of average degree edge-connectivityEdge-fault diameter of \(C_4\)-free graphsReliability evaluation for bijection-connected networks based on the super \(P_k\)-connectivitySymmetric property and edge-disjoint Hamiltonian cycles of the spined cubeThe \(t/m\)-diagnosis strategy of augmented \(k\)-ary \(n\)-cubesOn linear layout of bicube and construction of optimal incomplete bicubeReliability of \(m\)-ary \(n\)-dimensional hypercubes under embedded restrictionComponent Connectivity of Alternating Group Networks and Godan GraphsMaximum subgraph problem for 3-regular Knödel graphs and its wirelengthQuasi-Laplacian energy of composite graphs4-Free Strong Digraphs with the Maximum SizeThe spanning cyclability of Cayley graphs generated by transposition treesUnder which conditions is λ″(G)=κ″(L(G))  ?The geodesic transversal problem on some networksThe (n,k)-Modified-Bubble-Sort Graph: A Generalized Modified-Bubble-Sort GraphSome diameter notions of Fibonacci cubesA note on embeddings among folded hypercubes, even graphs and odd graphsImproved Bound for Dilation of an Embedding onto Circulant NetworksThe Optimal Design of Low-Latency Virtual BackbonesConditional fault diagnosis of hierarchical hypercubesEmbedding of special classes of circulant networks, hypercubes and generalized Petersen graphsOn the fault-tolerant diameter and wide diameter of ?-connected graphsUnnamed ItemMaximum incomplete recursive circulants in graph embeddingsNew largest known graphs of diameter 6VLSI layout of Benes networksSome edge‐fault‐tolerant properties of the folded hypercubeFault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by TranspositionsComponent factors of the Cartesian product of graphsThek-degree Cayley graph and its topological propertiesUnnamed ItemOn super edge-connectivity of Cartesian product graphsAutomorphisms and isomorphisms of enhanced hypercubesConditional fault-tolerant edge-bipancyclicity of hypercubes with faulty vertices and edgesVertex-fault-tolerant cycles embedding in 4-conditionally faulty folded hypercubesEdge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edgesMathematical properties of the hyperbolicity of circulant networksOn topological indices of certain interconnection networksBounds on general Randić index for \(F\)-sum graphsFault diameter of Cartesian product graphsFault diameter of product graphsSome network topological notions of the Mycielskian of a graphOptimal edge fault-tolerant bijective embedding of a complete graph over a cycleWirelength of enhanced hypercubes into \(r\)-rooted complete binary treesEmbedded connectivity of recursive networksOn some properties of doughnut graphsOn the edge-hyper-Hamiltonian laceability of balanced hypercubesEdge-bipancyclicity of star graphs under edge-fault tolerant\(\{2,3\}\)-extraconnectivities of hypercube-like networksEmbeddings of circulant networksFeedback numbers of Kautz digraphsOn reliability of the folded hypercubesOn the edge-forwarding indices of Frobenius graphsQueue layouts of iterated line directed graphsVulnerability of super edge-connected networksConditional diagnosability of arrangement graphs under the PMC modelThe \(3^{*}\)-connected property of pyramid networksDomination criticality in product graphsEmbedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelengthThe \(k\)-tuple twin domination in generalized de Bruijn and Kautz networksThe Menger number of the Cartesian product of graphsMinimum average congestion of enhanced and augmented hypercubes into complete binary treesMultiple regular graph embeddings into a hypercube with unbounded expansionSuper restricted edge connectivity of regular edge-transitive graphsBipanconnectivity of faulty hypercubes with minimum degree\(\{2,3\}\)-restricted connectivity of locally twisted cubesEmbedding of hypercubes into necklace, windmill and snake graphsExtraconnectivity of \(k\)-ary \(n\)-cube networksGray codes with bounded weightsNon-existence of bipartite graphs of diameter at least \(4\) and defect \(2\)Edge-bipancyclicity of star graphs with faulty elementsThe expected hitting times for finite Markov chainsDiameter variability of cycles and toriConditional diagnosability and strong diagnosability of split-star networks under the PMC modelExtended Petersen networksBothway embedding of circulant network into gridExtra edge connectivity and isoperimetric edge connectivityDecycling bubble sort graphsThe 2-path-bipanconnectivity of hypercubesFlexible cycle embedding in the locally twisted cube with nodes positioned at any prescribed distance







This page was built for publication: