scientific article

Gary Chartrand, Linda Lesniak, Ping Zhang

Publication date: 6 January 2011

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

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)

Related Items

Extremal total distance of graphs of given radius I ⋮ Automorphism groups of half cubes ⋮ Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang ⋮ Symbolic power decompositions of disjoint cycle graphs ⋮ Common Fixed Points Via R-Functions and Digraphs with an Application to Homotopy Theory ⋮ Unnamed Item ⋮ Weak PG-property and best proximity points ⋮ Computing volumes of adjacency polytopes via Draconian sequences ⋮ Extendiendo un resultado de coloraciones de gráficas a coloraciones de digráficas ⋮ Characterizations of graphs having large proper connection numbers ⋮ The quest for a characterization of hom-properties of finite character ⋮ Forbidden pairs and \((k,m)\)-pancyclicity ⋮ Saturation spectrum of paths and stars ⋮ The graph distance game and some graph operations ⋮ Remarks on Caristi's fixed point theorem in metric spaces with a graph ⋮ Note on semi-linkage with almost prescribed lengths in large graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the reliability of generalized Petersen graphs ⋮ Locating sets of vertices on Hamiltonian cycles ⋮ Cycles with a chord in dense graphs ⋮ Quasiperfect domination in trees ⋮ Efficient location of resources in cylindrical networks ⋮ Trees whose even-degree vertices induce a path are antimagic ⋮ On independent \([1, 2\)-sets in trees] ⋮ Graphs with the strong Havel-Hakimi property ⋮ Hamiltonian type properties in claw-free \(P_5\)-free graphs ⋮ On a canonical construction of tessellated surfaces from finite groups ⋮ Toughness, binding number and restricted matching extension in a graph ⋮ Implications in rainbow forbidden subgraphs ⋮ Secure domination in proper interval graphs ⋮ The property of \(k\)-colourable graphs is uniquely decomposable ⋮ Path homology theory of edge-colored graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Hyperbolic right-angled Coxeter groups with boundaries as a Sierpiński carpet and a Menger curve ⋮ Secure domination in cographs ⋮ Commutation classes of the reduced words for the longest element of \(\mathfrak{S}_{n}\) ⋮ Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor ⋮ Maximum size of digraphs of given radius ⋮ A note on global dominator coloring of graphs ⋮ Every grid has an independent \([1, 2\)-set] ⋮ Locating domination in bipartite graphs and their complements ⋮ Fixed point results for generalized contraction mappings and cyclical mappings in \(b\)-metric spaces endowed with a digraph ⋮ On the weighted safe set problem on paths and cycles ⋮ Gallai-Ramsey numbers for rainbow paths ⋮ Total domination in maximal outerplanar graphs. II. ⋮ Number of Ties and Undefeated Signs in a Generalized Janken ⋮ Partitioning vertices into in- and out-dominating sets in digraphs ⋮ Locating-dominating codes: bounds and extremal cardinalities ⋮ Common Fixed Point Results in C ∗ -Algebra Valued b-Metric Spaces Via Digraphs ⋮ Maximum edge-colorings of graphs ⋮ A Note on the Uniqueness of Zero-Divisor Graphs with Loops (Research) ⋮ A note on secure domination in \(C_5\)-free graphs ⋮ A lower bound for the packing chromatic number of the Cartesian product of cycles ⋮ Coincidence point results for graph preserving hybrid pair of mappings ⋮ Nordhaus-Gaddum bounds for locating domination ⋮ Caristi fixed point theorem in metric spaces with a graph ⋮ On large semi-linked graphs ⋮ Caterpillars are antimagic ⋮ Degree sum and graph linkage with prescribed path lengths ⋮ On cycles that alternate through selected sets of vertices ⋮ General upper bounds on independent \(k\)-rainbow domination ⋮ On a conjecture involving a bound for the total restrained domination number of a graph ⋮ Best monotone degree conditions for graph properties: a survey ⋮ Excessive index for mesh derived networks ⋮ Strong equilibrium in network congestion games: increasing versus decreasing costs ⋮ V_4-BIMAGIC GRAPHS ⋮ A conjecture on super edge-magic total labeling of 4-cycle books ⋮ Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs ⋮ Comparing the metric and strong dimensions of graphs ⋮ Some new coincidence point results for single-valued and multi-valued mappings in \(b\)-metric spaces via digraphs ⋮ Some fixed point theorems in cone modular spaces with a graph ⋮ Total domination in maximal outerplanar graphs ⋮ Enomoto and Ota's conjecture holds for large graphs ⋮ Recognition of split-graphic sequences ⋮ A scoring mechanism for the rank aggregation of network robustness ⋮ Properly colored \(C_4\)'s in edge-colored graphs ⋮ Placing specified vertices at precise locations on a Hamiltonian cycle ⋮ Failed power domination on graphs ⋮ Structural properties of subdivided-line graphs ⋮ Spanning bipartite graphs with high degree sum in graphs ⋮ The Ryjáček closure and a forbidden subgraph ⋮ A Poincaré-Bendixson theorem for hybrid dynamical systems on directed graphs ⋮ Neighbor-locating colorings in graphs ⋮ Neighbor-locating coloring: graph operations and extremal cardinalities ⋮ Packing functions and dominating functions of countable graphs ⋮ Tripartite graphs with given degree set ⋮ On the connected safe number of some classes of graphs ⋮ Spanning bipartite graphs with large degree sum in graphs of odd order ⋮ A general lower bound for the domination number of cylindrical graphs ⋮ Global cycle properties in graphs with large minimum clustering coefficient ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On perfect and quasiperfect dominations in graphs ⋮ Graphs obtained from collections of blocks ⋮ Super edge-magic labeling of graphs: deficiency and maximality ⋮ A New View of Hypercube Genus ⋮ Some product graphs with power dominating number at most 2 ⋮ Fixed points of monotone nonexpansive mappings on a hyperbolic metric space with a graph ⋮ The contraction principle for mappings on a modular metric space with a graph ⋮ On weighted adjacency operators associated to directed graphs ⋮ A new type of multivalued contraction in partial Hausdorff metric spaces endowed with a graph