Results 21 to 30 of about 1,946,730 (334)
Incidence matrices and line graphs of mixed graphs
Special Matrices, 2023 In the theory of line graphs of undirected graphs, there exists an important theorem linking the incidence matrix of the root graph to the adjacency matrix of its line graph. For directed or mixed graphs, however, there exists no analogous result.
Abudayah Mohammad +2 more
doaj +1 more source
Biomedical Interaction Prediction with Adaptive Line Graph Contrastive Learning
Mathematics, 2023 Biomedical interaction prediction is essential for the exploration of relationships between biomedical entities. Predicted biomedical interactions can help researchers with drug discovery, disease treatment, and more.
Shilin Sun +3 more
doaj +1 more source
The H-Line Signed Graph of a Signed Graph [PDF]
, 2010 For standard terminology and notion in graph theory we refer the reader to Harary; the non-standard will be given in this paper as and when required.
Rangarajan, R. +2 more
core +1 more source
The study of line graphs of subdivision graphs of some rooted product graphs via K-Banhatti indices
International Journal of Mathematics for Industry, 2023 The degree-based topological indices are numerical graph invariants that are used to link a molecule’s structural characteristics to its physical, and chemical characteristics.
K. J. Gowtham, N. Narahari
doaj +1 more source
On the planarity of line Mycielskian graph of a graph
Ratio Mathematica, 2020 The line Mycielskian graph of a graph G, denoted by Lμ(G) is defined as the graph obtained from L(G) by adding q+1 new vertices E' = ei' : 1 ≤ i ≤ q and e, then for 1 ≤ i ≤ q , joining ei' to the neighbours of ei and to e.
Keerthi G. Mirajkar +1 more
doaj +1 more source
Unavoidable induced subgraphs in large graphs with no homogeneous sets [PDF]
, 2015 A homogeneous set of an $n$-vertex graph is a set $X$ of vertices ($2\le |X|\le n-1$) such that every vertex not in $X$ is either complete or anticomplete to $X$. A graph is called prime if it has no homogeneous set.
Diestel +12 more
core +1 more source
On a Combinatorial Approach to Studying the Steiner Diameter of a Graph and Its Line Graph
Mathematics, 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
Characterizing ‐perfect line graphs [PDF]
International Transactions in Operational Research, 2016 AbstractThe aim of this paper is to study the Lovász‐Schrijver PSD operator applied to the edge relaxation of the stable set polytope of a graph. We are particularly interested in the problem of characterizing graphs for which generates the stable set polytope in one step, called ‐perfect graphs.
Escalante, Mariana Silvina +2 more
openaire +5 more sources
ConvGraph: Community Detection of Homogeneous Relationships in Weighted Graphs
Mathematics, 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
Expert interpretation of bar and line graphs: The role of graphicacy in reducing the effect of graph format. [PDF]
, 2015 The distinction between informational and computational equivalence of representations, first articulated by Larkin and Simon (1987) has been a fundamental principle in the analysis of diagrammatic reasoning which has been supported empirically on ...
Ali +33 more
core +2 more sources