Results 51 to 60 of about 34,901 (303)
Straight Line Triangle Representations [PDF]
, 2013 A straight line triangle representation (SLTR) of a planar graph is a straight line drawing such that all the faces including the outer face have triangular shape.
Felsner, Stefan +3 more
core +1 more source
Sufficient Conditions for Graphs to Be k-Connected, Maximally Connected, and Super-Connected
Complexity, 2021 Let G be a connected graph with minimum degree δG and vertex-connectivity κG. The graph G is k-connected if κG≥k, maximally connected if κG=δG, and super-connected if every minimum vertex-cut isolates a vertex of minimum degree. In this paper, we present
Zhen-Mu Hong +3 more
doaj +1 more source
Eternal domination and clique covering
Electronic Journal of Graph Theory and Applications, 2022 We study the relationship between the eternal domination number of a graph and its clique cove-ring number using both large-scale computation and analytic methods. In doing so, we answer two open questions of Klostermeyer and Mynhardt.
Gary MacGillivray +2 more
doaj +1 more source
Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem
, 2015 We consider arrangements of axis-aligned rectangles in the plane. A geometric arrangement specifies the coordinates of all rectangles, while a combinatorial arrangement specifies only the respective intersection type in which each pair of rectangles ...
Noellenburg, Martin +6 more
core +2 more sources
The Upper Total Triangle Free Detour Number of a Graph
, 2021 For a connected graph G = (V,E) of order at least two, a total triangle free detour set of a graph G is a triangle free detour set S such that the subgraph G[S] induced by S has no isolated vertices.
et. al., G. Priscilla Pacifica,
core +1 more source
Design and analysis strategies for robust microbiome ageing research
FEBS Letters, EarlyView.The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik +5 more
wiley +1 more source
Vertex Triangle Free Detour Number of a Graph
, 2021 The \emph{$x$-triangle free detour number} $dn_{\triangle f_x}(G)$ of a connected graph $G$ is the minimum order of its $x$-triangle free detour sets and any $x$-triangle free detour set $S_{x} \subseteq V$ of order $dn_{\triangle f_x}(G)$ is a ...
Keerthi Asir, I +2 more
core +1 more source
FEBS Open Bio, EarlyView.Hyperosmotic stress triggers the relocation of the CFIm complex from the nucleus to the cytoplasm. This shift creates a nuclear ‘stoichiometric bottleneck’, limiting CFIm availability for mRNA processing. Consequently, specific mRNAs like NUDT21 and DICER1 undergo targeted 3′UTR shortening, demonstrating how spatial protein dynamics drive rapid ...
Hitomi Soumiya +2 more
wiley +1 more source
A novel method to construct cospectral graphs based on RT operation [PDF]
AIP AdvancesThis paper presents a new graph operation, RT(G), which is formed by transforming each vertex and edge of the original graph G into a triangle. We analyze the relationship between the signless Laplacian characteristic polynomials of the graph RT(G) and ...
Xiu-Jian Wang +2 more
doaj +1 more source
Influence of Geometric Design on Mechanical Performance of Auxetic Metastructure
Advanced Engineering Materials, EarlyView.Strategic geometric reinforcement transforms auxetic performance. This study evaluates 3D‐printed arrowhead metastructures, revealing that a modified design with local ring reinforcement suppresses premature failure to achieve superior energy absorption and structural efficiency.
Muhammad Gulzari +3 more
wiley +1 more source