scientific article; zbMATH DE number 3159208
From MaRDI portal
Publication:3277097
Cited in
(only showing first 100 items - show all)- On the domination number of generalized petersen graphs \(P(n,2)\)
- A survey of stratified domination in graphs
- Generic properties of column-structured matrices
- Domination parameters for the bishops graph
- On some counting polynomials in chemistry
- Toroidal tilings from de Bruijn-Good cyclic sequences
- On a class of matrices with real eigenvalues
- De Bruijn sequences, irreducible codes and cyclotomy
- Complexity of problems in games, graphs and algebraic equations
- The frequency of cyclic processes in biological multistate systems
- The skeleton of an impartial game and the nim-function of Moore's \(\text{Nim}_2\)
- Remarks on the requirement matrix of school timetable problems and regular embeddings of graphs
- Nonexistence of seven-dimensional tangential 2-blocks
- Contributions to the theory of domination, independence and irredundance in graphs
- The complexity of social groups and social systems described by graph structures
- Chessboard domination problems
- On the thickness of graphs of given degree
- Cycles in extensive form perfect information games
- Matching theory -- a sampler: From Dénes König to the present
- Redundant networks and minimum distance
- Vector spaces and the four-color problem
- Infinite digraphs isomorphic with their line digraphs
- Extremal graphs of diameter 4
- A decomposition algorithm for optimality problems in tree-structured networks
- A note on applying a theorem of Tutte to graphical sequences
- On graphs with a constant link. II
- On sums of graph games with last player losing
- On enumerating paths of K arcs in unoriented complete graphs
- Paths in graphs and minimal -sequences in semigroups
- Associative products of graphs
- Nonexistence of six-dimensional tangential 2-block
- Simple directed trees
- Words with prescribed adjacencies
- On natural exactly covering systems of congruences having moduli occurring at most twice
- An introduction to matching polynomials
- Connectability and structural controllability of composite systems
- An upper bound for the -height of (0,1)-matrices
- The maximum number of K_j-subgraphs in a graph with k independent edges
- On the connectivity of clusters
- Constructing blockmodels: how and why
- Mathematical solution for a data processing system
- Upper and lower bounds for graph-diameter problems with application to Record allocation
- The sequence of upper and lower domination, independence and irredundance numbers of a graph
- Games without repetitions on digraphs
- An experimental comparison of three heuristics for the WVCP
- On edge semi-isomorphisms and semi-dualities of graphs
- One-node cutsets and the dominating set polytope
- Minimizing the total completion time in a unit-time open shop with release times
- TSP ejection chains
- Expressions for the perfect matching numbers of cubic l m n lattices and their asymptotic values
- On the equality of the partial Grundy and upper ochromatic numbers of graphs
- Relaxed tours and path ejections for the traveling salesman problem
- An upper bound for the minimum number of queens covering the \(n {\times} n\) chessboard
- The adjacency graphs of FSRs with a class of affine characteristic functions
- The probabilistic minimum dominating set problem
- On the Sprague-Grundy function of \textsc{Exact} \(k\)-\textsc{Nim}
- Domination in 4-regular Knödel graphs
- Online dominating set
- Domination-complete graphs
- ``Global graph problems tend to be intractable
- Hereditarily finite sets and identity trees
- Application of the algebra of polyrelatives to game theory
- Finite method for a nonlinear allocation problem
- Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue
- On the independent domination number of regular graphs
- Dijkstra, Floyd and Warshall meet Kleene
- Application of complex networks theory in urban traffic network researches
- Energy of double dominating bipolar fuzzy graphs
- Bounding the trace function of a hypergraph with applications
- Skeletons, shapes, and the shift from surface to structure in architectural geometry
- Independent domination of graphs with bounded maximum degree
- Isolation of \(k\)-cliques. II
- Domination in fuzzy incidence graphs based on valid edges
- A polynomial-time approximation to a minimum dominating set in a graph
- Which graphs occur as \(\gamma\)-graphs?
- Domination on hyperbolic graphs
- Detailed balance \(=\) complex balance \(+\) cycle balance: a graph-theoretic proof for reaction networks and Markov chains
- PBIB-designs and association schemes arising from minimum bi-connected dominating sets of hypercubes
- Small \(k\)-pyramids and the complexity of determining \(k\)
- An algorithm for obtaining the chromatic number and an optimal coloring of a graph
- Deterministic graphical games
- On graph fall-coloring: existence and constructions
- Applying graph theory to some problems of economic dynamics
- Efficient \(( t , r )\) broadcast dominating sets of the triangular lattice
- On the \(k\)-domination number of digraphs
- Estimate of the first eigenvalue of the Laplacian on a graph
- Structure indicators for transportation graph analysis. I: Planar connected simple graphs
- What is relative measurement! The ratio scale phantom
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
- A graph-theoretic algorithm for the solution of a linear diophantine problem of Frobenius
- On a linear diophantine problem of Frobenius: an improved algorithm
- Self-consistency, consistency and cycles in non-partitional knowledge models
- Extremal graphs for a new upper bound on domination parameters in graphs
- Unimodular modules
- A decomposition approach for solving a broadcast domination network design problem
- A tight upper bound for 2-rainbow domination in generalized Petersen graphs
- A note on the independent domination number in graphs
- Sufficient conditions for unique stable sets in three agent pillage games
- On a matrix-based measure of the degree of coreness of a node in a network
- The zoo of tree spanner problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3277097)
