Handbook of Graph Theory

From MaRDI portal
Publication:2868671

DOI10.1201/b16132zbMath1278.05001OpenAlexW2238639262MaRDI QIDQ2868671

No author found.

Publication date: 18 December 2013

Full work available at URL: http://hdl.handle.net/2117/22000




Related Items (38)

Characterisation and classification of signatures of spanning trees of the $n$-cubeThe soft graphic integer sub-decomposition method for elliptic scalar multiplicationThe elliptic scalar multiplication graph and its application in elliptic curve cryptographyLow-derivative operators of the standard model effective field theory via Hilbert series methodsPebbling in 2-pathsHamiltonian and pancyclic graphs in the class of self-centered graphs with radius twoIt's all a matter of degree. Using degree information to optimize multiway joinsGenus, thickness and crossing number of graphs encoding the generating properties of finite groupsAn algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelengthSuper \(H\)-antimagic total covering for generalized antiprism and toroidal octagonal mapOn vertex independence number of uniform hypergraphsOutliers in spectrum of sparse Wigner matricesWhich graphs occur as \(\gamma\)-graphs?The 2CNF Boolean formula satisfiability problem and the linear space hypothesisIndependent 2-point set domination in graphs - IIA STUDY ON EQUITABLE CHROMATIC AND THRESHOLD OF MYCIELSKIAN OF GRAPHSA characterization for 2-self-centered graphsOn min–max distance degree indexPebbling in powers of pathsPebbling in semi-2-treesReconstruction of score setsRecognition of split-graphic sequencesA novel graph-operational matrix method for solving multidelay fractional differential equations with variable coefficients and a numerical comparative survey of fractional derivative typesDistinguishing graphs of maximum valence 3Toeplitz-composition \(\mathrm{C}^\ast\)-algebras induced by linear-fractional non-automorphism self-maps of the diskSimplified target assignment problem for group engagement of aircraftResolving domination number of graphsTripartite graphs with given degree setUnnamed ItemUnnamed ItemGraph limits of random graphs from a subset of connected k‐treesIsomorphisms of maps on the sphereOn zero-error codes produced by greedy algorithmsOn \(H\)-supermagic labelings of \(m\)-shadow of paths and cyclesThe local partition dimension of graphsGraph complement conjecture for classes of shadow graphsLocal irregular vertex coloring of some families graphSafety in \(s\)-\(t\) paths, trails and walks




This page was built for publication: Handbook of Graph Theory