Results 81 to 90 of about 2,481 (263)

The Topological Connectivity of the Independence Complex of Circular-Arc Graphs

open access: yesUniversal 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

Loss of POGLUT2/3‐mediated O‐glucosylation produces lung and aortic phenotypes reminiscent of fibrillin1 mutants

open access: yesDevelopmental 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

Tree-layout based graph classes: proper chordal graphs [PDF]

open access: yes
Many standard graph classes are known to be characterized by means of layouts (a permutation of its vertices) excluding some patterns. Important such graph classes are among others: proper interval graphs, interval graphs, chordal graphs, permutation ...
Protopapas, Evangelos, Paul, Christophe
core   +2 more sources

On a Class of Graphs with Large Total Domination Number [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2018
Let $\gamma(G)$ and $\gamma_t(G)$ denote the domination number and the total domination number, respectively, of a graph $G$ with no isolated vertices. It is well-known that $\gamma_t(G) \leq 2\gamma(G)$.
Selim Bahadır, Didem Gözüpek
doaj   +1 more source

Chordally signed graphs

open access: yesDiscrete 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

Maxclique and unit disk characterizations of strongly chordal graphs [PDF]

open access: yes, 2019
Maxcliques (maximal complete subgraphs) and unit disks (closed neighborhoods of vertices) sometime play almost interchangeable roles in graph theory. For instance, interchanging them makes two existing characterizations of chordal graphs into two new ...
De Caria, Pablo Jesús, McKee, Terry A.
core  

Majorbio Cloud: An integrated platform for single‐omics and integrated multi‐omics analysis of microbiome and metabolome

open access: yesiMetaOmics, EarlyView.
Advances in sequencing and mass spectrometry have propelled life sciences into the multi‐omics era. Metabolomics and microbiomics are widely applied across various research fields, yet massive data analysis faces challenges like limited tool functionality and high technical barriers.
Jianhua Zhao   +16 more
wiley   +1 more source

Some structural graph properties of the non-commuting graph of a class of finite Moufang loops

open access: yesElectronic 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

Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT A bisection of a graph is a cut in which the number of vertices in the two parts of the cut differ by at most 1. In this paper, we consider maximum weight bisections of edge‐weighted triangle‐free subcubic graphs and show that every weighted triangle‐free subcubic graph G = ( V , E , w ) $G=(V,E,w)$ has a bisection with weight at least θ ⋅ w (
Stefanie Gerke   +3 more
wiley   +1 more source

A new construction for vertex decomposable graphs [PDF]

open access: yesTransactions 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  

Home - About - Disclaimer - Privacy