Results 11 to 20 of about 173,504,166 (216)
Resonance graphs and a binary coding of perfect matchings of outerplane bipartite graphs [PDF]
, 2023 The aim of this paper is to investigate resonance graphs of $2$-connected outerplane bipartite graphs, which include various families of molecular graphs. Firstly, we present an algorithm for a binary coding of perfect matchings of these graphs. Further,
Žigert Pleteršek, Petra +2 more
core +1 more source
Large-girth roots of graphs [PDF]
, 2010 We study the problem of recognizing graph powers and computing roots of graphs. Our focus is on classes of graphs with no short cycles. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r vertical bar 3, thus
Adamaszek, Michal +4 more
core +1 more source
Spectral characterization of families of split graphs [PDF]
, 2015 An upper bound for the sum of the squares of the entries of the principal eigenvector corresponding to a vertex subset inducing a k-regular subgraph is introduced and applied to the determination of an upper bound on the order of such induced subgraphs ...
Cardoso, Domingos M. +3 more
core +1 more source
, 2011 A graph that admits a Smarandachely super mean m-labeling is called a Smarandachely super m-mean graph, particularly, a mean graph if m = 2. In this paper, some new families of mean graphs are investigated.
Vaidya, S.K.
core +1 more source
Characterization of Line-Consistent Signed Graphs [PDF]
, 2015 The line graph of a graph with signed edges carries vertex signs. A vertex-signed graph is consistent if every circle (cycle, circuit) has positive vertex-sign product. Acharya, Acharya, and Sinha recently characterized line-consistent signed graphs, i.e.
Slilaty Daniel C. +4 more
core +3 more sources
Characterization of $2$-minimally nonouterplanar join graphs [PDF]
, 2001 summary:In this paper, we present characterizations of pairs of graphs whose join graphs are 2-minimally nonouterplanar. In addition, we present a characterization of pairs of graphs whose join graphs are 2-minimally nonouterplanar in terms of forbidden ...
Bano, J. K., Akka, D. G.
core +1 more source
Classes of graphs with restricted interval models [PDF]
, 1999 We introduce q-proper interval graphs as interval graphs with interval models in which no interval is properly contained in more than q other intervals, and also provide a forbidden induced subgraph characterization of this class of graphs.
Telle, Jan Arne +3 more
core +1 more source
Forbidden induced subgraph characterization of circle graphs within split graphs [PDF]
, 2020 A graph is circle if its vertices are in correspondence with a family of chords in a circle in such a way that every two distinct vertices are adjacent if and only if the corresponding chords have nonempty intersection.
Safe, Martín D. +3 more
core +1 more source
Testing first-order properties for subclasses of sparse graphs [PDF]
, 2013 We present a linear-time algorithm for deciding first-order (FO) properties in classes of graphs with bounded expansion, a notion recently introduced by Nešetřil and Ossona de Mendez.
Thomas, Robin +2 more
core +1 more source
Neutralization of the PTX3/CD44 axis suppresses TGF‐β1 signaling in kidney fibrosis
FEBS Letters, EarlyView.This study investigates how the PTX3/CD44 axis promotes kidney fibrosis by activating TGF‐β1 signaling. We demonstrate that the neutralizing antibody WHC‐001 effectively inhibits this pathway, suppressing myofibroblast activation and partial epithelial–mesenchymal transition (EMT).
Chao‐Chun Cheng +8 more
wiley +1 more source