Theory and Application of Graphs
From MaRDI portal
Publication:4435260
DOI10.1007/978-1-4419-8698-6zbMath1035.05003OpenAlexW604158355MaRDI QIDQ4435260
Publication date: 27 November 2003
Published in: Network Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4419-8698-6
Related Items (67)
Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs ⋮ Hamilton paths and cycles in varietal hypercube networks with mixed faults ⋮ MODELLING COLLABORATION NETWORKS BASED ON NONLINEAR PREFERENTIAL ATTACHMENT ⋮ Total and paired domination numbers of \(C_m\) bundles over a cycle \(C_n\) ⋮ Mutation on knots and Whitney's 2-isomorphism theorem ⋮ The forwarding indices of augmented cubes ⋮ Fault diameter of product graphs ⋮ Fault-tolerant analysis of a class of networks ⋮ The signed edge-domatic number of a graph ⋮ On Schreier graphs of gyrogroup actions ⋮ Distance irredundance and connected domination numbers of a graph ⋮ On autographix conjecture regarding domination number and average eccentricity ⋮ The signed edge-domatic number of nearly cubic graphs ⋮ On reliability of the folded hypercubes ⋮ The bondage numbers of graphs with small crossing numbers ⋮ Vulnerability of super edge-connected networks ⋮ The bondage number of generalized Petersen graphs \(P(n,2)\) ⋮ Fault diagnosability of data center networks ⋮ Trees with maximum \(p\)-reinforcement number ⋮ On region crossing change and incidence matrix ⋮ Unitary coined discrete-time quantum walks on directed multigraphs ⋮ On the complexity of the bondage and reinforcement problems ⋮ On Sullivan's conjecture on cycles in 4-free and 5-free digraphs ⋮ Super-connected but not super edge-connected graphs ⋮ Super restricted edge connectivity of regular edge-transitive graphs ⋮ A note on cycle embedding in hypercubes with faulty vertices ⋮ On the bounds of feedback numbers of \((n,k)\)-star graphs ⋮ The pessimistic diagnosability of data center networks ⋮ On restricted edge-connectivity of replacement product graphs ⋮ Some improved inequalities related to Vizing's conjecture ⋮ On bondage numbers of graphs: a survey with some comments ⋮ Non-existence of bipartite graphs of diameter at least \(4\) and defect \(2\) ⋮ On super connectivity of Cartesian product graphs ⋮ Total and paired domination numbers of toroidal meshes ⋮ The algorithmic complexity of bondage and reinforcement problems in bipartite graphs ⋮ Reliability of interconnection networks modeled by Cartesian product digraphs ⋮ The bondage numbers and efficient dominations of vertex-transitive graphs ⋮ Many-to-many disjoint paths in hypercubes with faulty vertices ⋮ On the \(p\)-reinforcement and the complexity ⋮ Bondage number of mesh networks ⋮ The super connectivity of augmented cubes ⋮ Lazy Constraint Imposing for Improving the Path Constraint ⋮ A new class of transitive graphs ⋮ Distance domination-critical graphs ⋮ Bounded edge-connectivity and edge-persistence of Cartesian product of graphs ⋮ Transitivity of varietal hypercube networks ⋮ ON THE ROMAN BONDAGE NUMBER OF A GRAPH ⋮ The total bondage number of grid graphs ⋮ Sequential composition of linear systems' clans ⋮ From Graph Theory to Models of Economic Networks. A Tutorial ⋮ Bondage numbers of Mycielski graphs ⋮ On super edge-connectivity of product graphs ⋮ Forwarding index of cube-connected cycles ⋮ Diameter vulnerability of graphs by edge deletion ⋮ Geometry of generated groups with metrics induced by their Cayley color graphs ⋮ Reinforcement numbers of digraphs ⋮ The 3-extra conditional diagnosability of balanced hypercubes under \(\mathrm{MM}^\ast\) model ⋮ Average distances and distance domination numbers ⋮ Maximum independent sets partition of \((n, k)\)-star graphs ⋮ Super connectivity of line graphs ⋮ When is region crossing change an unknotting operation? ⋮ Edge-fault-tolerant edge-bipancyclicity of hypercubes ⋮ The total bondage numbers and efficient total dominations of vertex-transitive graphs ⋮ On super edge-connectivity of Cartesian product graphs ⋮ The minimum eccentric distance sum of trees with given distance k-domination number ⋮ The maximal restricted edge connectivity of Kautz undirected graphs ⋮ Connectivity of Cartesian product graphs
This page was built for publication: Theory and Application of Graphs
