Results 91 to 100 of about 5,251,465 (203)

Atom-bond sum-connectivity index of line graphs [PDF]

Discrete Mathematics Letters, 2023
Yanyan Ge, Zhen Lin, Jiajia Wang
doaj   +1 more source

Efficient Direct Reconstruction of Bipartite (Multi)Graphs from Their Line Graphs Through a Characterization of Their Edges

Mathematics
We study the line graphs of bipartite multigraphs, which naturally arise in combinatorics, game theory, and applications such as scheduling and motion planning.
Drago Bokal, Janja Jerebic
doaj   +1 more source

GENERAL APPROACH TO LINE GRAPHS OF GRAPHS

Demonstratio Mathematica, 1985
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marczyk, Antoni, Skupień, Zdzisław
openaire   +1 more source

The asymptotic behavior of some indices of iterated line graphs of regular graphs

, 2012
In this paper, we consider the asymptotic behavior of the number of spanning trees and the Kirchhoff index of iterated line graphs and iterated para-line graphs (or clique-inserted graphs) of a regular graph G.
Yan, Weigen, Yeh, Yeong-Nan, Zhang, Fuji, 张福基   +3 more
core  

A novel algebraic technique for adjacency matrices of some derived graphs

Mathematical and Computer Modelling of Dynamical Systems
Graph energy has been the main concern of spectral graph theory in the last five decades. The classical graph energy is the sum of the absolute values of the eigenvalues of the adjacency matrix. In many research papers, different versions of graph energy
Hacer Ozden Ayna, Aysun Yurttas Gunes, Sadik Delen, Medha Itagi Huilgol, Berke Ozmen, Ismail Naci Cangul   +5 more
doaj   +1 more source

Interval line graphs

Discrete Mathematics, 1984
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Hierarchical Line Graph Neural Network: A Study on Alternative Representations of Graph-Structured Data [PDF]

openThis thesis addresses the challenge of feature-smoothing common in deep graph neural networks (GNNs), a topic of considerable interest over the past decade.
MOHAMMADI, SOLMAZ
core  

Total edge-betweenness centrality measure of a graph

Arab Journal of Basic and Applied Sciences
Edge-betweenness centrality measure is an important centrality measure that focuses on the role of edges in a graph. The total edge-betweenness centrality measure (EBCM) of a graph is defined as the sum of the edge-betweenness centrality measures of all ...
Niveditha, K. Arathi Bhat, Shahistha Hanif   +2 more
doaj   +1 more source

On •-Line Signed Graphs L•(S)

Discussiones Mathematicae Graph Theory, 2015
A signed graph (or sigraph for short) is an ordered pair S = (Su,σ), where Su is a graph, G = (V,E), called the underlying graph of S and σ : E → {+,−} is a function from the edge set E of Su into the set {+,−}.
Sinha Deepa, Dhama Ayushi
doaj   +1 more source

Graphs isomorphic to subgraphs of their line-graphs

Discrete Mathematics, 1982
AbstractAn embedding of graph G into graph H is by defenition an isomorphism of G onto a subgraph of H. It is shown in this paper that every unicycle U embeds in its line-graph L(U), and that every other connected graph that embeds in its own line-graph may be constructed from such an embedded unicycle in a natural way.
Douglas Bauer, Ralph Tindell
openaire   +3 more sources