scholarly journals Reconstruction of Graphs

2021 ◽  
Author(s):  
Sivaramakrishnan Monikandan
Keyword(s):  
Graph Theory ◽  
Short Proof ◽  
Final Solution

A graph is reconstructible if it is determined up to isomorphism from the collection of all its one-vertex deleted unlabeled subgraphs. One of the foremost unsolved problems in Graph Theory is the Reconstruction Conjecture, which asserts that every graph G on at least three vertices is reconstructible. In 1980’s, tremendous work was done and many significant results have been produced on the problem and its variations. During the last three decades, work on it has slowed down gradually. P. J. Kelly (1957) first noted that trees are reconstructible; but the proof is quite lengthy. A short proof, due to Greenwell and Hemminger (1973), was given which is based on a simple, but powerful, counting theorem. This chapter deals with the counting theorem and its subsequent applications; also it ends up with a reduction of the Reconstruction Conjecture using distance and connectedness, which may lead to the final solution of the conjecture.

scholarly journals A Relation of Dominance for the Bicriterion Bus Routing Problem

2017 ◽  
Vol 27 (1) ◽  
pp. 133-155 ◽  
Author(s):  
Jacek Widuch
Keyword(s):  
Graph Theory ◽  
Shortest Path ◽  
Experimental Tests ◽  
Partial Solution ◽  
Estimation Methods ◽  
Final Solution ◽  
Routing Problem ◽  
Variable Weights ◽  
Bus Routing ◽  
The Cost

Abstract A bicriterion bus routing (BBR) problem is described and analysed. The objective is to find a route from the start stop to the final stop minimizing the time and the cost of travel simultaneously. Additionally, the time of starting travel at the start stop is given. The BBR problem can be resolved using methods of graph theory. It comes down to resolving a bicriterion shortest path (BSP) problem in a multigraph with variable weights. In the paper, differences between the problem with constant weights and that with variable weights are described and analysed, with particular emphasis on properties satisfied only for the problem with variable weights and the description of the influence of dominated partial solutions on non-dominated final solutions. This paper proposes methods of estimation a dominated partial solution for the possibility of obtaining a non-dominated final solution from it. An algorithm for solving the BBR problem implementing these estimation methods is proposed and the results of experimental tests are presented.

scholarly journals Structure and Colour in Triangle-Free Graphs

10.37236/9267 ◽  
2021 ◽  
Vol 28 (2) ◽  
Author(s):  
N. R. Aravind ◽  
Stijn Cambie ◽  
Wouter Cames van Batenburg ◽  
Rémi De Joannis de Verclos ◽  
Ross J. Kang ◽  
...  
Keyword(s):  
Graph Theory ◽  
Chromatic Number ◽  
Short Proof ◽  
Independent Set ◽  
Extremal Graph ◽  
Extremal Graph Theory ◽  
Constant Multiple ◽  
Free Graph ◽  
Related Notion ◽  
Induced Path

Motivated by a recent conjecture of the first author, we prove that every properly coloured triangle-free graph of chromatic number $\chi$ contains a rainbow independent set of size $\lceil\frac12\chi\rceil$. This is sharp up to a factor $2$. This result and its short proof have implications for the related notion of chromatic discrepancy. Drawing inspiration from both structural and extremal graph theory, we conjecture that every triangle-free graph of chromatic number $\chi$ contains an induced cycle of length $\Omega(\chi\log\chi)$ as $\chi\to\infty$. Even if one only demands an induced path of length $\Omega(\chi\log\chi)$, the conclusion would be sharp up to a constant multiple. We prove it for regular girth $5$ graphs and for girth $21$ graphs. As a common strengthening of the induced paths form of this conjecture and of Johansson's theorem (1996), we posit the existence of some $c >0$ such that for every forest $H$ on $D$ vertices, every triangle-free and induced $H$-free graph has chromatic number at most $c D/\log D$. We prove this assertion with 'triangle-free' replaced by 'regular girth 5'.

Revealing gross three-dimensional structure in the SEM

1987 ◽  
Vol 45 ◽  
pp. 656-657
Author(s):  
Sterling P. Newberry
Keyword(s):  
Freeze Drying ◽  
Three Dimensional ◽  
Dimensional Structure ◽  
Small Object ◽  
Final Solution ◽  
Dimensional Representation ◽  
X Ray ◽  
Three Dimensional Representation ◽  
Freeze Dried ◽  
Critical Point Drying

The beautiful three dimensional representation of small object surfaces by the SEM leads one to search for ways to open up the sample and look inside. Could this be the answer to a better microscopy for gross biological 3-D structure? We know from X-Ray microscope images that Freeze Drying and Critical Point Drying give promise of adequately preserving gross structure. Can we slice such preparations open for SEM inspection? In general these preparations crush more readily than they slice. Russell and Dagihlian got around the problem by “deembedding” a section before imaging. This some what defeats the advantages of direct dry preparation, thus we are reluctant to accept it as the final solution to our problem. Alternatively, consider fig 1 wherein a freeze dried onion root has a window cut in its surface by a micromanipulator during observation in the SEM.

Pattern Recognition in Histo-Pathology: Basic Considerations

1982 ◽  
Vol 21 (01) ◽  
pp. 15-22 ◽  
Author(s):  
W. Schlegel ◽  
K. Kayser
Keyword(s):  
Pattern Recognition ◽  
Graph Theory ◽  
Normal Tissue ◽  
Diagnostic Procedures ◽  
Minimal Distance ◽  
Malignant Growth ◽  
Colon Tissue ◽  
First Results ◽  
Tissue Structures ◽  
The Given

A basic concept for the automatic diagnosis of histo-pathological specimen is presented. The algorithm is based on tissue structures of the original organ. Low power magnification was used to inspect the specimens. The form of the given tissue structures, e. g. diameter, distance, shape factor and number of neighbours, is measured. Graph theory is applied by using the center of structures as vertices and the shortest connection of neighbours as edges. The algorithm leads to two independent sets of parameters which can be used for diagnostic procedures. First results with colon tissue show significant differences between normal tissue, benign and malignant growth. Polyps form glands that are twice as wide as normal and carcinomatous tissue. Carcinomas can be separated by the minimal distance of the glands formed. First results of pattern recognition using graph theory are discussed.

Sign in / Sign up

Export Citation Format

Share Document