short edge
Recently Published Documents


TOTAL DOCUMENTS

23
(FIVE YEARS 5)

H-INDEX

6
(FIVE YEARS 1)

Author(s):  
Pingshan Li ◽  
Rong Liu ◽  
Xianglin Liu

The Cayley graph generated by a transposition tree [Formula: see text] is a class of Cayley graphs that contains the star graph and the bubble sort graph. A graph [Formula: see text] is called strongly Menger (SM for short) (edge) connected if each pair of vertices [Formula: see text] are connected by [Formula: see text] (edge)-disjoint paths, where [Formula: see text] are the degree of [Formula: see text] and [Formula: see text] respectively. In this paper, the maximally edge-fault-tolerant and the maximally vertex-fault-tolerant of [Formula: see text] with respect to the SM-property are found and thus generalize or improve the results in [19, 20, 22, 26] on this topic.


Author(s):  
Dragos Cvetkovic ◽  
Zorica Drazic ◽  
Vera Kovacevic-Vujcic

We consider the symmetric traveling salesman problem (TSP) with instances represented by complete graphs G with distances between cities as edge weights. A complexity index is an invariant of an instance I by which we predict the execution time of an exact TSP algorithm for I. In the paper [5] we have considered some short edge subgraphs of G and defined several new invariants related to their connected components. Extensive computational experiments with instances on 50 vertices with the uniform distribution of integer edge weights in the interval [1,100] show that there exists correlation between the sequences of selected invariants and the sequence of execution times of the well-known TSP Solver Concorde. In this paper we extend these considerations for instances up to 100 vertices.


2019 ◽  
Vol 61 (5) ◽  
pp. 1358-1364 ◽  
Author(s):  
Kin‐Lu Wong ◽  
Song‐En Lin ◽  
Imee Ristika Rahmi Barani ◽  
Wei‐Yu Li

2018 ◽  
Vol 144 ◽  
pp. 526-530 ◽  
Author(s):  
Oleksandr Menshykov ◽  
Olena Reut ◽  
Viktor Reut ◽  
Natalya Vaysfeld ◽  
Zinaida Zhuravlova
Keyword(s):  

2018 ◽  
Author(s):  
Martin Krejsa ◽  
Jiri Brozovsky ◽  
Petr Lehner ◽  
Stanislav Seitl ◽  
Zdenek Kala

2017 ◽  
Vol 26 (3) ◽  
pp. 759-769 ◽  
Author(s):  
Dragoš Cvetković ◽  
Mirjana Čangalović ◽  
Zorica Dražić ◽  
Vera Kovačević-Vujčić

2017 ◽  
Vol 754 ◽  
pp. 353-356 ◽  
Author(s):  
Stanislav Seitl ◽  
Petr Miarka ◽  
Lucie Malíková ◽  
Martin Krejsa

Attention to the fatigue cracks in steel structures and bridges has been paid for long time. In spite to efforts to eliminate the creation and propagation of fatigue cracks throughout the designed service life, cracks are still revealed during inspections. Note, that depending on location of initial crack, the crack may propagate from the edge or from the surface. The theoretical model of fatigue crack progression is based on linear fracture mechanics. Steel specimens are subjected to various load (tension, three-and four-point bending, pure bending etc.). The calibration functions for short edge cracks are compared for various load and the discrepancies are discussed.


Sign in / Sign up

Export Citation Format

Share Document