scholarly journals Further characterizations and Helly-property in k-trees

2016 ◽  
Vol 15 (3) ◽  
pp. 1-8
Author(s):  
H P Patil

The purpose of this paper is to obtain a characterization of $k$-trees in terms of $k$-connectivity and forbidden subgraphs. Also, we present the other characterizations of $k$-trees containing the full vertices by using the join operation. Further, we establish the property of $k$-trees dealing with the degrees and formulate the Helly-property for a family of nontrivial $k$-paths in a $k$-tree. We study the planarity of $k$-trees and express the maximal outerplanar graphs in terms of 2-trees and $K_2$-neighbourhoods. Finally, the similar type of results for the maximal planar graphs are obtained.

2013 ◽  
Vol 2013 ◽  
pp. 1-7
Author(s):  
Bibin K. Jose

Given an arbitrary nonempty subset M of vertices in a graph G=(V,E), each vertex u in G is associated with the set fMo(u)={d(u,v):v∈M,u≠v} and called its open M-distance-pattern. The graph G is called open distance-pattern uniform (odpu-) graph if there exists a subset M of V(G) such that fMo(u)=fMo(v) for all u,v∈V(G), and M is called an open distance-pattern uniform (odpu-) set of G. The minimum cardinality of an odpu-set in G, if it exists, is called the odpu-number of G and is denoted by od(G). Given some property P, we establish characterization of odpu-graph with property P. In this paper, we characterize odpu-chordal graphs, and thereby characterize interval graphs, split graphs, strongly chordal graphs, maximal outerplanar graphs, and ptolemaic graphs that are odpu-graphs. We also characterize odpu-self-complementary graphs, odpu-distance-hereditary graphs, and odpu-cographs. We prove that the odpu-number of cographs is even and establish that any graph G can be embedded into a self-complementary odpu-graph H, such that G and G¯ are induced subgraphs of H. We also prove that the odpu-number of a maximal outerplanar graph is either 2 or 5.


2007 ◽  
Vol 44 (3) ◽  
pp. 411-422 ◽  
Author(s):  
János Barát ◽  
Péter Varjú

A sequence of symbols a1 , a2 … is called square-free if it does not contain a subsequence of consecutive terms of the form x1 , …, xm , x1 , …, xm . A century ago Thue showed that there exist arbitrarily long square-free sequences using only three symbols. Sequences can be thought of as colors on the vertices of a path. Following the paper of Alon, Grytczuk, Hałuszczak and Riordan, we examine graph colorings for which the color sequence is square-free on any path. The main result is that the vertices of any k -tree have a coloring of this kind using O ( ck ) colors if c > 6. Alon et al. conjectured that a fixed number of colors suffices for any planar graph. We support this conjecture by showing that this number is at most 12 for outerplanar graphs. On the other hand we prove that some outerplanar graphs require at least 7 colors. Using this latter we construct planar graphs, for which at least 10 colors are necessary.


2007 ◽  
Vol 17 (02) ◽  
pp. 139-160 ◽  
Author(s):  
EMILIO DI GIACOMO ◽  
GIUSEPPE LIOTTA

Let G1 and G2 be two planar graphs having some vertices in common. A simultaneous embedding of G1 and G2 is a pair of crossing-free drawings of G1 and G2 such that each vertex in common is represented by the same point in both drawings. In this paper we show that an outerplanar graph and a simple path can be simultaneously embedded with fixed edges such that the edges in common are straight-line segments while the other edges of the outerplanar graph can have at most one bend per edge. We then exploit the technique for outerplanar graphs and paths to study simultaneous embeddings of other pairs of graphs. Namely, we study simultaneous embedding with fixed edges of: (i) two outerplanar graphs sharing a forest of paths and (ii) an outerplanar graph and a cycle.


10.37236/703 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Ross J. Kang ◽  
László Lovász ◽  
Tobias Müller ◽  
Edward R. Scheinerman

A graph $G$ is a $k$-dot product graph if there exists a vector labelling $u: V(G) \to \mathbb{R}^k$ such that $u(i)^{T}u(j) \geq 1$ if and only if $ij \in E(G)$. Fiduccia, Scheinerman, Trenk and Zito [Discrete Math., 1998] asked whether every planar graph is a $3$-dot product graph. We show that the answer is "no". On the other hand, every planar graph is a $4$-dot product graph. We also answer the corresponding questions for planar graphs of prescribed girth and for outerplanar graphs.


Author(s):  
J. I. Bennetch

In a recent study of the superplastic forming (SPF) behavior of certain Al-Li-X alloys, the relative misorientation between adjacent (sub)grains proved to be an important parameter. It is well established that the most accurate way to determine misorientation across boundaries is by Kikuchi line analysis. However, the SPF study required the characterization of a large number of (sub)grains in each sample to be statistically meaningful, a very time-consuming task even for comparatively rapid Kikuchi analytical techniques.In order to circumvent this problem, an alternate, even more rapid in-situ Kikuchi technique was devised, eliminating the need for the developing of negatives and any subsequent measurements on photographic plates. All that is required is a double tilt low backlash goniometer capable of tilting ± 45° in one axis and ± 30° in the other axis. The procedure is as follows. While viewing the microscope screen, one merely tilts the specimen until a standard recognizable reference Kikuchi pattern is centered, making sure, at the same time, that the focused electron beam remains on the (sub)grain in question.


1982 ◽  
Vol 47 (03) ◽  
pp. 197-202 ◽  
Author(s):  
Kurt Huber ◽  
Johannes Kirchheimer ◽  
Bernd R Binder

SummaryUrokinase (UK) could be purified to apparent homogeneity starting from crude urine by sequential adsorption and elution of the enzyme to gelatine-Sepharose and agmatine-Sepharose followed by gel filtration on Sephadex G-150. The purified product exhibited characteristics of the high molecular weight urokinase (HMW-UK) but did contain two distinct entities, one of which exhibited a two chain structure as reported for the HMW-UK while the other one exhibited an apparent single chain structure. The purification described is rapid and simple and results in an enzyme with probably no major alterations. Yields are high enough to obtain purified enzymes for characterization of UK from individual donors.


Genetics ◽  
2000 ◽  
Vol 154 (1) ◽  
pp. 121-132
Author(s):  
Zhen Hu ◽  
Yingzi Yue ◽  
Hua Jiang ◽  
Bin Zhang ◽  
Peter W Sherwood ◽  
...  

Abstract Expression of the MAL genes required for maltose fermentation in Saccharomyces cerevisiae is induced by maltose and repressed by glucose. Maltose-inducible regulation requires maltose permease and the MAL-activator protein, a DNA-binding transcription factor encoded by MAL63 and its homologues at the other MAL loci. Previously, we showed that the Mig1 repressor mediates glucose repression of MAL gene expression. Glucose also blocks MAL-activator-mediated maltose induction through a Mig1p-independent mechanism that we refer to as glucose inhibition. Here we report the characterization of this process. Our results indicate that glucose inhibition is also Mig2p independent. Moreover, we show that neither overexpression of the MAL-activator nor elimination of inducer exclusion is sufficient to relieve glucose inhibition, suggesting that glucose acts to inhibit induction by affecting maltose sensing and/or signaling. The glucose inhibition pathway requires HXK2, REG1, and GSF1 and appears to overlap upstream with the glucose repression pathway. The likely target of glucose inhibition is Snf1 protein kinase. Evidence is presented indicating that, in addition to its role in the inactivation of Mig1p, Snf1p is required post-transcriptionally for the synthesis of maltose permease whose function is essential for maltose induction.


Mathematics ◽  
2021 ◽  
Vol 9 (2) ◽  
pp. 116
Author(s):  
Qi Liu ◽  
Yongjin Li

In this paper, we will introduce a new geometric constant LYJ(λ,μ,X) based on an equivalent characterization of inner product space, which was proposed by Moslehian and Rassias. We first discuss some equivalent forms of the proposed constant. Next, a characterization of uniformly non-square is given. Moreover, some sufficient conditions which imply weak normal structure are presented. Finally, we obtain some relationship between the other well-known geometric constants and LYJ(λ,μ,X). Also, this new coefficient is computed for X being concrete space.


BMC Zoology ◽  
2020 ◽  
Vol 5 (1) ◽  
Author(s):  
Ansa E. Cobham ◽  
Christen K. Mirth

Abstract Background Organisms show an incredibly diverse array of body and organ shapes that are both unique to their taxon and important for adapting to their environment. Achieving these specific shapes involves coordinating the many processes that transform single cells into complex organs, and regulating their growth so that they can function within a fully-formed body. Main text Conceptually, body and organ shape can be separated in two categories, although in practice these categories need not be mutually exclusive. Body shape results from the extent to which organs, or parts of organs, grow relative to each other. The patterns of relative organ size are characterized using allometry. Organ shape, on the other hand, is defined as the geometric features of an organ’s component parts excluding its size. Characterization of organ shape is frequently described by the relative position of homologous features, known as landmarks, distributed throughout the organ. These descriptions fall into the domain of geometric morphometrics. Conclusion In this review, we discuss the methods of characterizing body and organ shape, the developmental programs thought to underlie each, highlight when and how the mechanisms regulating body and organ shape might overlap, and provide our perspective on future avenues of research.


Sign in / Sign up

Export Citation Format

Share Document