Search

Intraoperative CT scanning is the international standard for treating midface fractures as it allows intraoperative assessment of reduction and fixation. To our knowledge, no NHS hospital in the UK has this facility yet due to the financial and logistical burden of its implementation. The aim of this study was to determine if complications including the requirement for a return to theatre (RTT) could have been predicted from the post-fixation CT scan. All treated midface fractures that had presented to a regionalised major trauma centre within two years (01 January 2020 - 31 December 2021) were identified. Those developing complications including RTT were determined. All postoperative CT scans (including those without complication or RTT) were re-analysed with the clinicians blinded to the outcomes to determine the positive predictive value (PPV) and negative predictive value (NPV) of requiring RTT to alter plate position intraoperatively based on CT scan alone. In all, there were eight episodes of unplanned return to theatre, resulting in an overall RTT rate of 8/119 (6.7%). When only analysing patients treated for orbital fractures this RTT rises to 8/40 (20%). Of those eight patients who had a postoperative CT and required RTT, this could have been predicted in 7/8 (87.5%). A total of 16/44 (36.4%) patients that did not have RTT would have additionally been recommended to have the plate position altered based on CT alone. Based upon those that had a CT, the PPV of CT alone being able to predict those requiring RTT was 40.6% and the NPV 96.2%. Our results would suggest intraoperative CT would likely have prevented eight patients requiring RTT in two years and could have improved outcomes in 16 cases. In preventing RTT as well as potentially improving the outcomes of a further 16 cases in maxillofacial surgery, the purchase of an intraoperative CT scanner could yield net savings of £75534-£114990 over two years. [ABSTRACT FROM AUTHOR]

Unlike fractures of the remaining facial skeleton, fractures of the non-condylar part of the mandible are invariably treated surgically, with the potential risk of further iatrogenic injury. There is, however, a substantial evidence gap pertaining to the potential non-surgical management of such injuries. The aim of this study was to determine the outcomes of mandibular fractures treated with non-surgical management. All patients with mandibular fractures who were referred to a large regional major trauma service over a one-year period (1 January–31 December 2021) were identified. Those treated with surgery or who sustained fractures of the condylar portion of the mandible were excluded. Of all the patients referred to our unit with mandibular fractures, 34/155 (22%) underwent non-surgical management. In all cases plain radiographs demonstrated minimal displacement. Thirty-two (94%) fractures were unilateral, of which 24 (70%) involved the angle. Two of 34 patients subsequently required open reduction and internal fixation due to pain that did not improve over time, one of whom declined. A minimally extruded tooth in the fracture line, which altered the occlusion in one additional patient, required minimal reduction of the enamel. The remaining patients healed without complication six weeks after injury. Non- surgical management requires careful case selection and regular follow up, so is of value to only a small proportion of patients. Twenty-two per cent of all mandibular fractures were managed non-surgically at our unit in one year, with a 97% success rate, demonstrating the potential utility of this strategy in carefully selected cases. [ABSTRACT FROM AUTHOR]

India's telecommunication network, by number of telephone users and internet user base, is the second largest in the world. There are different providers of cell phone services in our country and they play an important role in meeting the needs of customers. Jio has gained a significant market share and has accomplished numbers that look to attain competitiveness over a decade. It is the only network in India that is 4G only and its USP is the free services it provides. As part of its 4G offerings, Jio released a bundle of multimedia applications on Google Play in May 2016. While the apps are available for all to download, a user would need a Jio SIM card for them. A computer network or a data network is the digital telecommunication network that enables Reliance JIO Limited a subsidiary of Reliance Industry Limited to provide resources. Reliance JIO Limited is India's largest private sector company, which is the first telecom operator to hold a unified licence for pan India. The business offers all communications services except satellite-serviced global mobile personal contact. This research includes examining consumer satisfaction with the Jio network and gathering data from 50 respondents with the aid of a convenient sampling technique. From its research, this study suggests improving network coverage and call connectivity. [ABSTRACT FROM AUTHOR]

The issue of determining the complexity of modification problems for chordal bipartite graphs has been raised multiple times in the literature. We show that the completion and deletion problems for chordal bipartite graphs are NP-hard. The corresponding problems for weakly chordal graphs are already known to be hard. As a byproduct, we obtain results on modification problems for a variety of related classes of graphs and also simplify the arguments for the class of weakly chordal graphs. [ABSTRACT FROM AUTHOR]

Maxillofacial injuries related to push-bikes have been well documented. An often-overlooked area is maxillofacial trauma related to scooters. Our aim is to describe non-motorized and motorized scooter-related maxillofacial injuries with a view to focus on prevention of these injuries. We also aim to address an ever-growing incidence of eScooter-related maxillofacial trauma. Patients presenting at RSUH were identified via the ED database via keyword search 'scooter' and 'face' between 2015 and 2021. Notes were reviewed and information regarding age, gender, mechanism, type of injury, treatment, helmet use and type of scooter was collated and analyzed. A total of 37 patients were identified including use of an escooter (n=2). Nearly 80% were Male (n=29) and 8 Female. Most patients fell off the scooter (n=35) whilst two patients were involved in collisions. The most common age groups of patients were 5-9 and 10-14 with 14 patients each fitting in to those age groups. Lacerations (n=24) and dentoalveolar (n=18) injuries were sustained as well as one zygomatic and one orbital fracture recorded. 81% patients were managed operatively under LA and GA. The use of nonmotorized scooters by children can result in facial trauma. Cases are usually non-life threatening but most will require surgical intervention and can result in loss of function and cosmetic defects. These injuries are potentially preventable with the use of helmets with faceguards and patient/parent education. The rise of eScooter use in the UK should remain a cause for concern as the trial programs expand. [ABSTRACT FROM AUTHOR]

A vertex of a connected graph is a contour vertex provided the eccentricity of the vertex is at least as large as that of each of its neighbors. We consider the question of whether the set S of contour vertices of a connected graph is geodetic, i.e., whether every vertex of the graph lies on a shortest path (geodesic) between some pair of vertices in S . In general, it is known that when long induced cycles are forbidden (for chordal graphs) the answer is in the affirmative, but otherwise (even for weakly chordal graphs) the answer is in the negative. For bipartite graphs, it is known that when long induced cycles are allowed, the answer is in the negative. In contrast, we show that when long induced cycles are forbidden in bipartite graphs, namely for chordal bipartite graphs, the answer is in the affirmative. Our result also shows that while the answer is in the negative for bipartite graphs and weakly chordal graphs, for a graph that is both bipartite and weakly chordal, the answer is in the affirmative. [ABSTRACT FROM AUTHOR]

The scope of the study is to find out the cause, effect of stress on employees performance. This also suggests ways and means both technically and methodically to over - come the stress. This study covers only employees of 3I - Infotech Company situated in Chennai with the study population of 100 respondents. The study was carried out by the self - administered questionnaire and evaluated using convenience sampling method and by deploying the percentage and Chi Square Test tools, the data was analysed. Indeed it has its own limitation in the form of accessing the employees, improper response and also due to confinement of small company. The conclusion of the study was that there was no relationship among measures of relaxation and symptoms of stress with employees' service. [ABSTRACT FROM AUTHOR]

Three rice genotypes, IR 74802, IR 73104 and IR 72593, along with FL 478 and IR 29 as resistant and susceptible controls, respectively, were subjected to 21 days' salinity stress at the seedling stage in modified yoshida solution with two salt levels (60 and 120 mM NaCl). The results indicated that there was a profound increase in proline and ascorbic acid levels, and in the activity of nitrate reductase and antioxidant enzymes, i.e. catalase, peroxidase and ascorbate peroxidase, as well as malondialdhyde and membrane stability index, which were associated with salt tolerance. Salt stress had a significant and drastic effect on all parameters when the salinity level increased to 120 mM NaCl. The increased enzyme activity was directly related to an increased membrane stability index, as in IR 72593, which is identified as the most tolerant among the genotypes tested. It is clearly confirmed that predicting tolerance at the early seedling stage is the best way to assess the salinity tolerance level by utilizing physiological parameters, especially antioxidant enzyme activities which are found to be closely associated with salinity tolerance. Physiological adaptation of the plant to NaCl salt stress resulted in enhanced activity of stress-related enzymes and low sodium uptake in tolerant genotypes. [ABSTRACT FROM PUBLISHER]

A cycle C in a graph is extendable if there exists a cycle C' such that V (C) ⊆ V (C') and |V (C')| = |V (C)| + 1. A graph is cycle extendable if every non-Hamiltonian cycle in the graph is extendable. An open question is whether or not every Hamiltonian chordal graph is cycle extendable. We show that Hamiltonian spider intersection graphs, a subclass of Hamiltonian chordal graphs, are cycle extendable. Our result generalizes known results on cycle extendability in interval graphs and split graphs. [ABSTRACT FROM AUTHOR]

This study investigated stress and coping strategies adopted by faculties in some selected colleges in five states. Questionnaire forms were administered to collect relevant data form 12 randomly selected colleges in India. The result of a chi-square analysis revealed that male and female colleges were significantly different in stress experience, but respondents of different marital status were significantly different. The study also found that male and female, and married and single respondents were significantly different in their coping strategies. The implications of these findings to counselling were discussed in this paper. [ABSTRACT FROM AUTHOR]

Abstract: We show that the maximum induced matching problem can be solved on hhd-free graphs in time; hhd-free graphs generalize chordal graphs and the previous best bound was . Then, we consider a technique used by Brandstädt and Hoàng (2008) to solve the problem on chordal graphs. Extending this, we show that for a subclass of hhd-free graphs that is more general than chordal graphs the problem can be solved in linear time. We also present examples to demonstrate the tightness of our results. [Copyright &y& Elsevier]

A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-leaf root of G. This notion was introduced and studied by Nishimura, Ragde, and Thilikos [2002], motivated by the search for underlying phylogenetic trees. Their results imply an O(n³)-time recognition algorithm for 4-leaf powers. Recently, Rautenbach [2006] as well as Dom et al. [2005] characterized 4-leaf powers without true twins in terms of forbidden subgraphs. We give new characterizations for 4-leaf powers and squares of trees by a complete structural analysis. As a consequence, we obtain a conceptually simple linear-time recognition of 4-leaf powers. [ABSTRACT FROM AUTHOR]

The κ-partition problem is as follows: Given a graph G and a positive integer κ, partition the vertices of G into at most κ parts A1, A2,...,Aκ, where it may be specified that Ai induces a stable set, a clique, or an arbitrary subgraph, and pairs Ai, Aj (i ≠ j) be completely nonadjacent, completely adjacent, or arbitrarily adjacent. The list κ-partition problem generalizes the κ-partition problem by specifying for each vertex x, a list L(x) of parts in which it is allowed to be placed. Many well-known graph problems can be formulated as list κ-partition problems: e.g., 3-colorability, clique cutset, stable cutset, homogeneous set, skew partition, and 2-clique cutset. We classify, with the exception of two polynomially equivalent problems, each list 4-partition problem as either solvable in polynomial time or NP-complete. In doing so, we provide polynomial-time algorithms for many problems whose polynomial-time solvability was open, including the list 2- clique cutset problem. This also allows us to classify each list generalized 2-clique cutset problem and list generalized skew partition problem as solvable in polynomial time or NP-complete. [ABSTRACT FROM AUTHOR]

The class of hhds-free graphs properly generalizes the classes of strongly chordal graphs and distance-hereditary graphs, and forms a restriction of the class of perfectly orderable graphs. The problem of recognizing hhds-free graphs in polynomial time was posed by Brandstädt (Problem session, Dagstuhl seminor No. 04221, 2004), and Nikolopoulos and Palios (Proceedings of the 31st International Workshop on Graph Theoretic Concepts in Computer Science, 2005) gave an O( m n 2) algorithm. We present an O( n 3)-time algorithm for the problem. Our algorithm demonstrates a relationship between hhds-free graphs and strongly chordal graphs similar to that which is known to exist between hhd-free graphs and chordal graphs. [ABSTRACT FROM AUTHOR]

We use a new structural theorem on the presence of two-pairs in weakly chordal graphs to develop improved algorithms. For the recognition problem, we reduce the time complexity from O(mn²) to O(m²) and the space complexity from O(n³) to O(m+n), and also produce a hole or antihole if the input graph is not weakly chordal. For the optimization problems, the complexity of the clique and coloring problems is reduced from O(mn²) to O(n³) and the complexity of the independent set and clique cover problems is improved from O(n4) to O(mn). The space complexity of our optimization algorithms is O(m + n). [ABSTRACT FROM AUTHOR]

A cycle C in a graph is extendable if there exists a cycle C′ such that V (C) ⊆ V (C′) and ∣ V (C′) ∣ = ∣ V (C) ∣ + 1. A graph is cycle extendable if every non-Hamiltonian cycle in the graph is extendable. An unresolved question is whether or not every Hamiltonian chordal graph is cycle extendable. We show that Hamiltonian graphs in classes such as interval, split, and in some subclasses of strongly chordal graphs, are cycle extendable. We also address efficiently finding a Hamilton cycle in some cases. A unifying theme to our approach is the use of appropriate vertex elimination orders. [ABSTRACT FROM AUTHOR]

The class of weakly triangulated comparability graphs and their complements are generalizations of interval graphs and chordal comparability graphs. We show that problems on these classes of graphs can be solved efficiently by transforming them into problems on chordal bipartite graphs. We show that recognition and independent set on weakly triangulated comparability graphs can be solved in O(n²) time in this manner, and that the number of weakly triangulated comparability graphs is 2#Θ(nlog²n)$. We also give algorithms to compute transitive closure and transitive reduction in O(n²loglogn) time if the underlying undirected graph of the transitive closure is a weakly triangulated comparability graph. [ABSTRACT FROM AUTHOR]

A thin layer chromatography study was conducted on the essential oils from leaf, stem-bark and root-bark of the genus Cinnamomum found in Sri Lanka. Wild Cinnamomum species such as Cinnamomum capparucoronde, Cinnamomum citriodarum, Cinnamomum dubium, Cinnamomum litseaefolium, Cinnamomum ovalifolium, Cinnamomum rivulorm and Cinnamomum sinharajanse were investigated, together with the cultivated cinnamon (Cinnammum verum, synonym Cinnamomum zeylanicum) to identify their major chemical constituents. Cinnamaldehyde, eugenol, linalool, a-terpineol, acetyleugenol and cineole were primarily detected. There were some variations among the species in the main components of leaf and stem-bark oils. Major constituents in stem-bark oil were either cinnamaldehyde (Cinnamomum citriodorum and Cinnamomum verum), linalool (Cinnamomum dubium and Cinnamomum ovalifolium), α-terpineol (Cinnamomum litseaefolium) or eugenol (Cinnamomum capparucoronde and Cinnamomum rivulorum). In oil extracted from the leaf, the principal constituents were either eugenol (Cinnamomum capparucoronde, Cinnamomum rivulorum, Cinnamomum sinharajanse and Cinnamomum verum), linalool (Cinnamomum litseaefolium), ཀྵ-terpineol (Cinnamomum dubium and Cinnamomum ovalifolium) or citronellal (Cinnamomum citriodorum). The presence of citronellal in cinnamomum species is here reported for the first time. All species examined had camphor as the major component in their root-bark oils. [ABSTRACT FROM PUBLISHER]

Abstract: We show that bisplit graphs can be recognized in time. The previous best bound of for the problem appeared in a recently published article [A. Brandstädt, P.L. Hammer, V.B. Le, V.V. Lozin, Bisplit graphs, Discrete Math. 299 (2005) 11–32] in this journal. [Copyright &y& Elsevier]

We present an-time algorithm for computing a maximum cardinality induced matching and a minimum cardinality cover by chain subgraphs for convex bipartite graphs. This improves the previous time bound of . [Copyright &y& Elsevier]

We call a chordless path v1v2…vi simplicial if it does not extend into any chordless path v0v1v2…vivi+1. Trivially, for every positive integer k, a graph contains no chordless cycle of length k+3 or more if each of its nonempty induced subgraphs contains a simplicial path with at most k vertices; we prove the converse. The case of k=1 is a classic result of Dirac. [Copyright &y& Elsevier]

Abstract: We show that a graph has no houses and no holes if and only if for every connected induced subgraph of and every vertex in , either the vertex is adjacent to all the other vertices in , or it forms a 2-pair of with some other vertex in . As a consequence, there is a simple linear time algorithm to find a 2-pair in HH-free graphs. We also note that the class of Meyniel graphs admits an analogous characterization. [Copyright &y& Elsevier]

Abstract: We consider the class of (, diamond)-free graphs; graphs in this class do not contain a or a diamond as an induced subgraph. We provide an efficient recognition algorithm for this class. We count the number of maximal cliques in a (, diamond)-free graph and the number of -vertex, labeled (, diamond)-free graphs. We also give an efficient algorithm for finding a largest clique in the more general class of (house, diamond)-free graphs. [Copyright &y& Elsevier]

This paper presents new algorithms for recognizing several classes of perfectly orderable graphs. Bipolarizable and P4-simplicial graphs are recognized in O(n3.376) time, improving the previous bounds of O(n4) and O(n5), respectively. Brittle and semi-simplicial graphs are recognized in O(n3) time using a randomized algorithm, and O(n3 log2n) time if a deterministic algorithm is required. The best previous time bound for recognizing these classes of graphs is O(m2). Welsh–Powell opposition graphs are recognized in O(n3) time, improving the previous bound of O(n4). HHP-free graphs and maxibrittle graphs are recognized in O(mn) and O(n3.376) time, respectively. [Copyright &y& Elsevier]