Results 71 to 80 of about 756 (218)
On b-perfect Chordal Graphs [PDF]
Graphs and Combinatorics, 2009 The b-chromatic number of a graph G is the largest integer k such that G has a coloring of the vertices in k color classes such that every color class contains a vertex that has a neighbour in all other color classes. We characterize the class of chordal graphs for which the b-chromatic number is equal to the chromatic number for every induced subgraph.
Maffray, Frédéric, Mechebbek, Meriem
openaire +3 more sources
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
Discussiones Mathematicae Graph Theory, 2016 We study domination between different types of walks connecting two non-adjacent vertices u and v of a graph (shortest paths, induced paths, paths, tolled walks).
Alcón Liliana
doaj +1 more source
The Topological Connectivity of the Independence Complex of Circular-Arc Graphs
Universal Journal of Mathematics and Applications, 2019 Let us denoted the topological connectivity of a simplicial complex $C$ plus 2 by $\eta(C)$. Let $\psi$ be a function from class of graphs to the set of positive integers together with $\infty$. Suppose $\psi$ satisfies the following properties: \newline
Yousef Abd Algani
doaj +1 more source
Discrete Mathematics, 2003 This paper studies dual-chordal graphs, that is, graphs that are dual to chordal graphs with regard to cycle/cutset duality. A characteristic of such graphs is that every cutset with at least four edges is accompanied by a certain kind of edge, a ``cut-chord.'' One result allows us to recognize dual-chordal graphs by simply looking at cubic graphs.
openaire +1 more source
Developmental Dynamics, EarlyView.Abstract Background Fibrillins provide a scaffold for elastic fiber formation, which enables lung recoil and aortic compliance. Abnormal fibrillin microfibrils, as in Marfan syndrome, lead to enlarged alveoli, vascular stiffening, and aneurysms. Our earlier studies suggested that fibrillin function depends on O‐glucosylation of its epidermal growth ...
Sanjiv Neupane +4 more
wiley +1 more source
Discrete Applied Mathematics, 2002 A chordally signed graph is defined as a signed chordal graph (each edge is designated as being positive or negative and every induced cycle is a triangle) in which every cycle \(C\) containing an even number of negative edges (positive cycles) has a chord \(e\) such that \(C\cup\{e\}\) forms two positive cycles.
openaire +1 more source
Interdisciplinary Materials, EarlyView.Vibrations in matter, from spider webs to molecules, water to flames, share a grammar with music. We propose that creativity emerges when constraints force expansion beyond existing possibilities. Selective imperfection restores balance, enabling invention.
Markus J. Buehler
wiley +1 more source
A new construction for vertex decomposable graphs [PDF]
Transactions on Combinatorics, 2016 Let G be a finite simple graph on the vertex set V(G) and let S⊆V(G). Adding a whisker to G at x means adding a new vertex y and edge xy to G where x∈V(G). The graph G∪W(S) is obtained from G by adding a whisker to every vertex of S. We prove that if G∖S
Nasser Hajisharifi, Abolfazl Tehranian
doaj
Some structural graph properties of the non-commuting graph of a class of finite Moufang loops
Electronic Journal of Graph Theory and Applications, 2020 For any non-abelian group G, the non-commuting graph of G, Γ=ΓG, is a graph with vertex set G \ Z(G), where Z(G) is the set of elements of G that commute with every element of G and distinct non-central elements x and y of G are joined by an edge if and ...
Hamideh Hasanzadeh Bashir +1 more
doaj +1 more source