scientific article

Publication date: 27 January 2005

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 (only showing first 100 items - show all)

Hamiltonian decompositions of Cayley graphs on Abelian groups ⋮ Ascending subgraph decompositions of tournaments of orders \(6n+2\) and \(6n+1\) ⋮ Isolate domination in graphs ⋮ Bounds on the signed Roman \(k\)-domination number of a digraph ⋮ Domination and total domination in complementary prisms ⋮ Saturation numbers for nearly complete graphs ⋮ Efficient domination through eigenvalues ⋮ Vertex in-magic arc labelings of digraphs ⋮ A note on distance magic and distance antimagic graphs ⋮ On \(S\)-magic graphs ⋮ A new measure for gracefulness of graphs ⋮ Opinion functions on trees ⋮ Star-factorization of symmetric complete bipartite digraphs ⋮ The independent transversal dombondage number of a graph ⋮ Upper secure domination number of a graph ⋮ Ascending subgraph decompositions of oriented graphs that factor into triangles ⋮ On the locating matrix of a graph and its spectral analysis ⋮ Connectivity of graphs with given girth pair ⋮ The commutation graph for the longest signed permutation ⋮ Ascending subgraph decompositions in oriented complete balanced tripartite graphs ⋮ Fastest expected time to mixing for a Markov chain on a directed graph ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ A note on zero-divisor graph of amalgamated duplication of a ring along an ideal ⋮ Local coloring of self complementary graphs ⋮ Small alliances in a weighted graph ⋮ Forbidden subgraphs generating a finite set ⋮ A note on powers of Hamilton cycles in generalized claw-free graphs ⋮ A panconnectivity theorem for bipartite graphs ⋮ Edge consecutive gracefulness of a graph ⋮ Edge irredundant colorings in graphs ⋮ Criticality of outer-connected independence upon edge removal ⋮ Graph access structures with optimal pixel expansion three ⋮ The Menger number of the strong product of graphs ⋮ Walks on tilings of polygons ⋮ Precise location of vertices on Hamiltonian cycles ⋮ Superconnectivity of graphs with odd girth \(g\) and even girth \(h\) ⋮ Independent protection in graphs ⋮ Global security in claw-free cubic graphs ⋮ Coprime index of a graph ⋮ On domination number of Cartesian product of directed paths ⋮ The fractional metric dimension of graphs ⋮ Spanning trees homeomorphic to a small tree ⋮ Domination number of Cartesian products of directed cycles ⋮ \(k\)-rainbow domatic numbers ⋮ Vertex covers and eternal dominating sets ⋮ Star-factors with large components ⋮ A generalization of 0-sum flows in graphs ⋮ Global Roman domination in graphs ⋮ Some defective parameters in graphs ⋮ Properly colored paths and cycles ⋮ New bounds for the broadcast domination number of a graph ⋮ Global dominator coloring of graphs ⋮ Minimum edge cuts in diameter 2 graphs ⋮ Duality for the Ising model on a random lattice and topologic excitons ⋮ On the upper bounds of fractional metric dimension of symmetric networks ⋮ On the bipartite vertex frustration of graphs ⋮ Highly irregular digraphs ⋮ Induced graphoidal decompositions in product graphs ⋮ Induced label graphoidal graphs ⋮ On the \(\lambda ^{\prime}\)-optimality in graphs with odd girth \(g\) and even girth \(h\) ⋮ Broadcasts and domination in trees ⋮ Gallai-Ramsey numbers for cycles ⋮ Sensitivity analysis of perfect state transfer in quantum spin networks ⋮ Packing parameters in graphs ⋮ A sufficient degree condition for a graph to contain all trees of size \(k\) ⋮ An intermediate value theorem for the arboricities ⋮ Local antimagic vertex coloring of a graph ⋮ A branching greedoid for multiply-rooted graphs and digraphs ⋮ Graphs with equal eternal vertex cover and eternal domination numbers ⋮ The diachromatic number of digraphs ⋮ On domination number of Cartesian product of directed cycles ⋮ Various bounds for liar's domination number ⋮ Restrained bondage in graphs ⋮ Graphic sequences with a realization containing a complete multipartite subgraph ⋮ Classification of upper bound sequences of local fractional metric dimension of rotationally symmetric hexagonal planar networks ⋮ Locating and multiplicative locating indices of graphs with QSPR analysis ⋮ Infinite families of directed strongly regular graphs using equitable partitions ⋮ Weak saturation numbers for multiple copies ⋮ On compact symmetric regularizations of graphs ⋮ Matrix norms and rapid mixing for spin systems ⋮ Note on locating pairs of vertices on Hamiltonian cycles ⋮ Covering graphs with few complete bipartite subgraphs ⋮ Minimum degree and pan-\(k\)-linked graphs ⋮ Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles ⋮ The possible cardinalities of global secure sets in cographs ⋮ Study of exponential growth constants of directed heteropolygonal Archimedean lattices ⋮ Radial trees ⋮ deBruijn-like sequences and the irregular chromatic number of paths and cycles ⋮ Partitioning graphs into complete and empty graphs ⋮ Counting stable sets on Cartesian products of graphs ⋮ Mixed cages ⋮ Corona domination number of graphs ⋮ A characterization of \(P_5\)-free graphs with a homeomorphically irreducible spanning tree ⋮ Geometric biplane graphs. I: Maximal graphs ⋮ General bounds on rainbow domination numbers ⋮ On the edge-integrity of some graphs and their complements ⋮ Elimination properties for minimal dominating sets of graphs ⋮ On independent doubly chorded cycles ⋮ The domination game played on diameter 2 graphs ⋮ Corrigendum to: ``Independent transversal domination in graphs

This page was built for publication: