Similar Search Results

Construction of Graph Pairs with Numerical Isomerism

Bier, Thomas - 2018

In this paper we construct for each integer ≥ 11, ≠ 12 15 a pair of trees of order which are not isomorphic but numerically isomeric. We also construct for each even ≥ 12 a pair of 2connected cubic graphs with the same property

Persistent link: https://www.econbiz.de/10012919478

The Face Labeling of Planar Graphs

Cahit, I. - 2018

been considered. The face-labeling of maximal planar graph may be viewed as tool in the search of an alternative proof the …

Persistent link: https://www.econbiz.de/10012920998

Efficient Rectilinear Minimum Spanning Tree Without Delaunay Triangulation

Zhou, Hai - 2018

spanning graph which is more natural than Delaunay triangulation for minimum spanning tree construction and design an efficient …

Persistent link: https://www.econbiz.de/10012921625

On the Online Shortest Path Problem

Waller, S. Travis - 2018

This paper is concerned with the stochastic shortest path problem with recourse when limited forms of spatial and temporal arc cost dependencies are accounted for. Recourse is defined as the opportunity for a decision-maker to re-evaluate his or her remaining path when en route information is...

Persistent link: https://www.econbiz.de/10012921655

Some Results on Regularable Graphs

Cahit, I. - 2018

A graph is called regularable if it is possible to label its edges with integers so that the sum of the integers … assigned to the edges incident to the vertices are all same, say equal to . Clearly if the given graph is regular of degree … of graphs.Particularly we have shown that a graph can never be regularable, can be regularable with only = 0 with the use …

Persistent link: https://www.econbiz.de/10012921669

Graphs with Minimum Degree Three are Totally Dominated by Half of the Vertices

Yuster, Raphael - 2018

Let = () be a graph without isolated vertices. We say that ⊂ is a if every vertex has a neighbor in . Let () denote the … minimum cardinality of a total dominating set of . We prove that if is a graph of order and minimum degree at least 3 then …

Persistent link: https://www.econbiz.de/10012922414

Recognizing Large-Degree Intersection Graphs of Linear 3-Uniform Hypergraphs

Metelsky, Yury - 2018

Let denote the class of intersection graphs of linear 3-uniform hypergraphs. In this paper a polynomial algorithm solving the recognition problem for the graphs with bound on minimum vertex degree δ()≥ 13 is proposed

Persistent link: https://www.econbiz.de/10012923086

The Maximum -Depth Spanning Tree Problem

Monnot, Jérôme - 2018

This paper deals with the problem of constructing directed trees of optimal weight and root with depth at most (||) (called − ). We first prove that the maximization and the minimization versions are equal-approximable under the that measures how the value of an approximate solution is placed...

Persistent link: https://www.econbiz.de/10012923915

The Maximum -Depth Spanning Tree Problem

Monnot, Jérôme - 2018

This paper deals with the problem of constructing directed trees of optimal weight and root with depth at most (||) (called – ). We first prove that the maximization and the minimization versions are equal-approximable under the that measures how the value of an approximate solution is placed...

Persistent link: https://www.econbiz.de/10012924574

A Polynomial Time Algorithm for Determining Zero Euler-Petrie Genus of an Eulerian Graph

Brigitte, Herman - 2018

A dual-Eulerian graph is a plane graph which has an ordering defined on its edge set which forms simultaneously an … Euler circuit in the graph and an Euler circuit in the dual graph. Dual-Eulerian graphs were defined and studied in the …

Persistent link: https://www.econbiz.de/10012924575