Keyword: graphs

Found 1175 papers in total
An acyclic outranking model to support group decision making within organizations
An acyclic outranking model to support group decision making within organizations
2012,
A model to support group decision making within the board of any organization to...
Geometrical aspects of optimum truss like structures for three‐force problem
Geometrical aspects of optimum truss like structures for three‐force problem
2012,
In this paper, similarities between three‐force and three‐point...
An imperfect repair strategy for two‐dimensional warranty
An imperfect repair strategy for two‐dimensional warranty
2012,
The objective of this study is to develop a warranty servicing strategy, based on...
Parity and strong parity edge‐colorings of graphs
Parity and strong parity edge‐colorings of graphs
2012,
A parity walk in an edge‐coloring of a graph is a walk along which each color...
On the complexity of path problems in properly colored directed graphs
On the complexity of path problems in properly colored directed graphs
2012,
We address the complexity class of several problems related to finding a path in a...
A branch‐and‐bound algorithm for the minimum cut linear arrangement problem
A branch‐and‐bound algorithm for the minimum cut linear arrangement problem
2012,
Given an edge‐weighted graph G of order n , the minimum cut linear arrangement...
Algebraic connectivity of an even uniform hypergraph
Algebraic connectivity of an even uniform hypergraph
2012,
We generalize Laplacian matrices for graphs to Laplacian tensors for even uniform...
An optimal square coloring of planar graphs
An optimal square coloring of planar graphs
2012,
The square coloring of a graph is to color the vertices of a graph at distance at most...
The paths embedding of the arrangement graphs with prescribed vertices in given position
The paths embedding of the arrangement graphs with prescribed vertices in given position
2012,
Let n and k be positive integers with n − k ≥2. The arrangement graph A n , k...
PTAS for the minimum weighted dominating set in growth bounded graphs
PTAS for the minimum weighted dominating set in growth bounded graphs
2012,
The minimum weighted dominating set (MWDS) problem is one of the classic...
The undirected capacitated arc routing problem with profits
The undirected capacitated arc routing problem with profits
2010,
A profit and a demand are associated with each edge of a set of profitable edges of a...
The Maximum Degree & Diameter‐Bounded Subgraph and its Applications
The Maximum Degree & Diameter‐Bounded Subgraph and its Applications
2012,
We introduce the problem of finding the largest subgraph of a given weighted...
The total {k}‐domatic number of wheels and complete graphs
The total {k}‐domatic number of wheels and complete graphs
2012,
Let k be a positive integer and let G be a graph with vertex set V ( G ). The total {...
Vertices in all minimum paired‐dominating sets of block graphs
Vertices in all minimum paired‐dominating sets of block graphs
2012,
Let G =( V , E ) be a simple graph without isolated vertices. A set S ⊆ V is a...
The second largest number of maximal independent sets in connected graphs with at most one cycle
The second largest number of maximal independent sets in connected graphs with at most one cycle
2012,
A maximal independent set is an independent set that is not a proper subset of any...
On L(2,1)‐labeling of generalized Petersen graphs
On L(2,1)‐labeling of generalized Petersen graphs
2012,
A variation of the classical channel assignment problem is to assign a radio channel...
Random restricted matching and lower bounds for combinatorial optimization
Random restricted matching and lower bounds for combinatorial optimization
2012,
We prove results on optimal random extensions of trees over points in [0,1] d . As an...
Some results on the injective chromatic number of graphs
Some results on the injective chromatic number of graphs
2012,
A k ‐coloring of a graph G =( V , E ) is a mapping c : V →{1,2,…, k...
On cyclic vertex‐connectivity of Cartesian product digraphs
On cyclic vertex‐connectivity of Cartesian product digraphs
2012,
For a strongly connected digraph D =( V ( D ), A ( D )), a vertex‐cut S ⊆...
Note on the hardness of generalized connectivity
Note on the hardness of generalized connectivity
2012,
Let G be a nontrivial connected graph of order n and let k be an integer with 2≤ k...
Minimum statuses of connected graphs with fixed maximum degree and order
Minimum statuses of connected graphs with fixed maximum degree and order
2012,
The status of a vertex in a connected graph is the sum of distances between the vertex...
The undirected m‐Capacitated Peripatetic Salesman Problem
The undirected m‐Capacitated Peripatetic Salesman Problem
2012,
In the m ‐Capacitated Peripatetic Salesman Problem ( m ‐CPSP) the aim is...
Stochastic analysis of ordered median problems
Stochastic analysis of ordered median problems
2012,
Many location problems can be expressed as ordered median objective. In this paper, we...
Exact interdiction models and algorithms for disconnecting networks via node deletions
Exact interdiction models and algorithms for disconnecting networks via node deletions
2012,
This paper analyzes the problem of maximizing the disconnectivity of undirected graphs...
Papers per page: