Showing items 1 - 20 of 21

Your selections:

A lower bound on the zero forcing number

An algebraic approach to lifts of digraphs

Calculating the extremal number ex (v ; {C₃, C₄, ..., Cn})

Calculating the extremal number ex (v ; {C₃, C₄, ..., Cn})

Complete catalogue of graphs of maximum degree 3 and defect at most 4

Degree diameter problem on honeycomb networks

Diameter-sufficient conditions for a graph to be super-restricted connected

Domination chain: Characterisation, classical complexity, parameterised complexity and approximability

Equality of domination and transversal numbers in hypergraphs

Monitoring the edges of a graph using distances

On bipartite graphs of defect at most 4

On graphs of defect at most 2

On the connectivity and superconnected graphs with small diameter

On the number of components of (k, g)-cages after vertex deletion

Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs

Scheduling arc maintenance jobs in a network to maximise total flow over time

Superconnectivity of regular graphs with small diameter

The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks

The maximum degree and diameter-bounded subgraph in the mesh

Vertex-magic labeling of regular graphs: disjoint unions and assemblages

  • Disclaimer
  • Privacy
  • Copyright
  • Contact
  • Deposit