Results 81 to 90 of about 5,172,585 (353)

Graphoidal graphs and graphoidal digraphs: a generalization of line graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
A graphoidal cover of a graph G is a collection ψ of paths (not necessarily open) in G such that each path in ψ has at least two vertices, every vertex of G is an internal vertex of at most one path in ψ, and every edge of G is in exactly one path in Let
S. Arumugam, Jay S. Bagga
doaj   +1 more source

LeL-GNN: Learnable Edge Sampling and Line Based Graph Neural Network for Link Prediction

open access: yesIEEE Access, 2023
Graph neural networks lose a lot of their computing power when more network layers are added. As a result, the majority of existing graph neural networks have a shallow depth of learning. Over-smoothing and information loss are two of the key issues that
Md Golam Morshed   +2 more
doaj   +1 more source

General sum-connectivity index, general product-connectivity index, general Zagreb index and coindices of line graph of subdivision graphs

open access: yesAKCE Int. J. Graphs Comb., 2017
The general sum-connectivity index, general product-connectivity index, general Zagreb index and coindices of line graphs of subdivision graphs of tadpole graphs, wheels and ladders have been reported in the literature.
H. Ramane, V. V. Manjalapur, I. Gutman
semanticscholar   +1 more source

On-line rankings of graphs

open access: yesDiscrete Mathematics, 2000
Let \(G= (V,E)\) be a simple graph. A vertex \(k\)-ranking of \(G\) is a proper vertex coloring \(\varphi: V\to\{1,\dots, k\}\) such that every path in \(G\) with endvertices \(x\) and \(y\) of the same color \(\varphi(x)= \varphi(y)\) contains a vertex \(z\) with higher color \(\varphi(z)> \varphi(x)\).
Ingo Schiermeyer   +2 more
openaire   +2 more sources

Septin 9 PB domains coordinate centrosome positioning and microtubule acetylation to control epithelial polarity

open access: yesFEBS Letters, EarlyView.
Septin 9 polybasic domains couple phosphoinositide‐rich membrane binding to centrosome positioning, Golgi organization, and microtubule acetylation to control epithelial polarity. Their loss disrupts this axis, causing centrosome mispositioning, Golgi fragmentation, reduced microtubule acetylation, and polarity inversion via upregulation of the ...
Ting ting Cai   +4 more
wiley   +1 more source

Generative Service Provisioning for IoT Devices Using Line Graph Structure

open access: yesIEEE Access, 2023
A service subgraph helps Internet-of-Things devices access resources in a dynamic Internet-of-Things device network. We propose a service subgraph generation method for Internet-of-Things device networks.
Joohyun Kim, Jae-Hoon Kim
doaj   +1 more source

PPGNet: Learning Point-Pair Graph for Line Segment Detection [PDF]

open access: yesComputer Vision and Pattern Recognition, 2019
In this paper, we present a novel framework to detect line segments in man-made environments. Specifically, we propose to describe junctions, line segments and relationships between them with a simple graph, which is more structured and informative than ...
Ziheng Zhang   +8 more
semanticscholar   +1 more source

Line Graphs of Monogenic Semigroup Graphs

open access: yesJournal of Mathematics, 2021
The concept of monogenic semigroup graphs Γ S M
Nihat Akgunes   +2 more
openaire   +2 more sources

Rab14 regulates the transport of human papillomavirus to the trans‐Golgi network for infectious cell entry

open access: yesFEBS Letters, EarlyView.
This study reveals that the small GTPase Rab14 is necessary for human papillomavirus (HPV) infection and plays an essential role in the transport of virions to the trans‐Golgi network (TGN). HPV in the early endosome (EE), which harbors GTP‐bound Rab14, is transported to the TGN through the switch of Rab14 from its GTP‐bound to GDP‐bound form.
Yoshiyuki Ishii, Iwao Kukimoto
wiley   +1 more source

Eulerian Cycle Decomposition Conjecture for the line graph of complete graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2019
The Eulerian Cycle Decomposition Conjecture, by Chartrand, Jordon and Zhang, states that if the minimum number of odd cycles in a cycle decomposition of an Eulerian graph of size is the maximum number of odd cycles in such a cycle decomposition is and is
R. Rajarajachozhan, R. Sampathkumar
doaj   +1 more source

Home - About - Disclaimer - Privacy