Results 61 to 70 of about 5,172,585 (353)

Characterization of Line-Consistent Signed Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 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., Zaslavsky Thomas
doaj   +1 more source

The line completion number of hypercubes

open access: yesAKCE International Journal of Graphs and Combinatorics, 2019
In 1992, Bagga, Beineke, and Varma introduced the concept of the super line graph of index r of a graph G, denoted by ℒr(G). The vertices of ℒr(G)are the r-subsets of E(G), and two vertices S and T are adjacent if there exist s∈S and t∈T such that s and ...
S.A. Tapadia, B.N. Waphare
doaj   +1 more source

On a Combinatorial Approach to Studying the Steiner Diameter of a Graph and Its Line Graph

open access: yesMathematics, 2022
In 1989, Chartrand, Oellermann, Tian and Zou introduced the Steiner distance for graphs. This is a natural generalization of the classical graph distance concept. Let Γ be a connected graph of order at least 2, and S\V(Γ).
Hongfang Liu   +3 more
doaj   +1 more source

A Bibliometric Analysis of Publications in Uremic Toxins From 1991 to 2024

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Background Uremic toxins are a growing area of research in nephrology, with significant implications in the progression and treatment of chronic kidney disease (CKD) and the management of end‐stage kidney disease (ESKD). This bibliometric analysis aims to evaluate the global research trends, key contributors, and the impact of publications in ...
Yuh‐Shan Ho   +7 more
wiley   +1 more source

ConvGraph: Community Detection of Homogeneous Relationships in Weighted Graphs

open access: yesMathematics, 2021
This paper proposes a new method, ConvGraph, to detect communities in highly cohesive and isolated weighted graphs, where the sum of the weights is significantly higher inside than outside the communities.
Héctor Muñoz   +4 more
doaj   +1 more source

Projective dimension and regularity of the path ideal of the line graph [PDF]

open access: yes, 2016
By generalizing the notion of the path ideal of a graph, we study some algebraic properties of some path ideals associated to a line graph. We show that the quotient ring of these ideals are always sequentially Cohen–Macaulay and also provide some exact ...
G. Zhu
semanticscholar   +1 more source

Clique number of the square of a line graph [PDF]

open access: yesDiscrete Mathematics, 2015
We prove that the clique number of the square of a line graph of a graph G is at most 1.5 Δ G 2 and that the fractional strong chromatic index of G is at most 1.75 Δ G 2 .An edge coloring of a graph G is strong if each color class is an induced matching ...
Małgorzata Śleszyńska-Nowak
semanticscholar   +1 more source

Negation Switching Equivalence in Signed Graphs [PDF]

open access: yes, 2010
Unless mentioned or defined otherwise, for all terminology and notion in graph theory the reader is refer to [8].
Reddy, Siva Kota
core   +1 more source

Enteropathogenic E. coli shows delayed attachment and host response in human jejunum organoid‐derived monolayers compared to HeLa cells

open access: yesFEBS Letters, EarlyView.
Enteropathogenic E. coli (EPEC) infects the human intestinal epithelium, resulting in severe illness and diarrhoea. In this study, we compared the infection of cancer‐derived cell lines with human organoid‐derived models of the small intestine. We observed a delayed in attachment, inflammation and cell death on primary cells, indicating that host ...
Mastura Neyazi   +5 more
wiley   +1 more source

On two energy-like invariants of line graphs and related graph operations

open access: yesJournal of Inequalities and Applications, 2016
For a simple graph G of order n, let μ 1 ≥ μ 2 ≥ ⋯ ≥ μ n = 0 $\mu_{1}\geq\mu_{2}\geq\cdots\geq\mu_{n}=0$ be its Laplacian eigenvalues, and let q 1 ≥ q 2 ≥ ⋯ ≥ q n ≥ 0 $q_{1}\geq q_{2}\geq\cdots\geq q_{n}\geq0$ be its signless Laplacian eigenvalues.
Xiaodan Chen, Yaoping Hou, Jingjian Li
doaj   +1 more source

Home - About - Disclaimer - Privacy