Results 71 to 80 of about 10,361 (216)
Clique Graphs of Chordal and Path Graphs [PDF]
SIAM Journal on Discrete Mathematics, 1994 Clique graphs of chordal and (undirected) path graphs are characterized. The clique graph of a graph \(G\) is the intersection graph of maximal cliques of \(G\). A chordal graph is the intersection graph of subtrees of a tree. A path graph is the intersection graph of paths of a tree. (Given a family \(F\) of subsets, the intersection graph of \(F\) is
Szwarcfiter, Jayme L. +1 more
openaire +2 more sources
Carpathian Journal of Mathematics, 2021 Triangulated graphs have many interesting properties (perfection, recognition algorithms, combinatorial optimization algorithms with linear complexity). Hyper-triangulated graphs are those where each induced subgraph has a hyper-simplicial vertex. In this paper we give the characterizations of hyper-triangulated graphs using an ordering of vertices and
openaire +1 more source
Deep Underground Science and Engineering, EarlyView.B1 is bord width 1, B2 is bord width 2, L is the pillar length, W is the pillar width, red color and letter A represent the pillars, and white color and number 1 represent excavated areas. Pstress is the average pillar stress; σv is the vertical component of the virgin stress, MPa; and e is the areal extraction ratio. e = B o B o + B P ${\rm{e}}=\frac{{
Tawanda Zvarivadza +4 more
wiley +1 more source
Requiring that Minimal Separators Induce Complete Multipartite Subgraphs
Discussiones Mathematicae Graph Theory, 2018 Complete multipartite graphs range from complete graphs (with every partite set a singleton) to edgeless graphs (with a unique partite set). Requiring minimal separators to all induce one or the other of these extremes characterizes, respectively, the ...
McKee Terry A.
doaj +1 more source
Learning Inclusion-Optimal Chordal Graphs
, 2008 Appears in Proceedings of the Twenty-Fourth Conference on Uncertainty in Artificial Intelligence (UAI2008)
Auvray, Vincent, Wehenkel, Louis
openaire +3 more sources
Developmental Dynamics, EarlyView.Abstract Background Midline establishment is a fundamental process during early embryogenesis for Bilaterians. Midline morphogenesis in non‐amniotes can occur without mitosis, through Planar Cell Polarity (PCP) signaling. By contrast, amniotes utilize both cellular processes for developing the early midline landmark, the primitive streak (PS).
Zhiling Zhao, Rieko Asai, Takashi Mikawa
wiley +1 more source
Chordal multipartite graphs and chordal colorings
Discrete Mathematics, 2007 A graph is defined to be chordal colorable if it admits a proper vertex-coloring such that each minimal separator induces a subgraph in which two vertices are adjacent if and only if they are differently colored. All chordal graphs and all chordal bipartite graphs are chordal colorable. All chordal colorable graphs are weakly chordal.
openaire +1 more source
Energy Science &Engineering, EarlyView.This paper aims to provide a robust design approach for HAWTs operating in shear flow. This study fills a critical research gap by integrating BEM and vortex theories for blade design in non‐homogeneous inflow conditions. The authors of the paper made an effort to develop and test an experimentally unsophisticated model of a turbine working in shear ...
Agnieszka Dorota Woźniak +2 more
wiley +1 more source
On rank-width of even-hole-free graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 We present a class of (diamond, even hole)-free graphs with no clique cutset that has unbounded rank-width. In general, even-hole-free graphs have unbounded rank-width, because chordal graphs are even-hole-free. A.A. da Silva, A. Silva and C.
Isolde Adler +5 more
doaj +1 more source
Distance Approximating Trees for Chordal and Dually Chordal Graphs [PDF]
Journal of Algorithms, 1999 Summary: We show that, for each chordal graph \(G\), there is a tree \(T\) such that \(T\) is a spanning tree of the square \(G^2\) of \(G\) and, for every two vertices, the distance between them in \(T\) is not larger than the distance in \(G\) plus 2.
Brandstädt, Andreas +2 more
openaire +2 more sources