Theory and Application of Graphs
From MaRDI portal
Publication:4435260
DOI10.1007/978-1-4419-8698-6zbMath1035.05003MaRDI 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
05-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics
Related Items
MODELLING COLLABORATION NETWORKS BASED ON NONLINEAR PREFERENTIAL ATTACHMENT, Non-existence of bipartite graphs of diameter at least \(4\) and defect \(2\), Connectivity of Cartesian product graphs, The forwarding indices of augmented cubes, Fault diameter of product graphs, Distance irredundance and connected domination numbers of a graph, On reliability of the folded hypercubes, The bondage numbers of graphs with small crossing numbers, The super connectivity of augmented cubes, A new class of transitive graphs, Bounded edge-connectivity and edge-persistence of Cartesian product of graphs, On super edge-connectivity of product graphs, Forwarding index of cube-connected cycles, Diameter vulnerability of graphs by edge deletion, Reinforcement numbers of digraphs, Average distances and distance domination numbers, Super connectivity of line graphs, Edge-fault-tolerant edge-bipancyclicity of hypercubes, Fault-tolerant analysis of a class of networks, The bondage numbers and efficient dominations of vertex-transitive graphs, Distance domination-critical graphs, On super edge-connectivity of Cartesian product graphs, The maximal restricted edge connectivity of Kautz undirected graphs, On super connectivity of Cartesian product graphs, Reliability of interconnection networks modeled by Cartesian product digraphs, From Graph Theory to Models of Economic Networks. A Tutorial
