Results 51 to 60 of about 5,251,465 (203)
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
A Tabu Search Based Approach for Graph Layout [PDF]
, 2014 This paper describes an automated tabu search based method for drawing general graph layouts with straight lines. To our knowledge, this is the first time tabu methods have been applied to graph drawing.
Rodgers, Peter, Dib, Fadi
core +2 more sources
On two energy-like invariants of line graphs and related graph operations
Journal 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
Line graph embedding of co-intersection graph of ideals of commutative rings
AKCE International Journal of Graphs and CombinatoricsThis research paper focuses on the co-intersection graph of a commutative ring [Formula: see text]. The co-intersection graph of [Formula: see text] denoted by [Formula: see text] is a simple graph with vertices that are non-trivial ideals of [Formula ...
Ali Al Khabyah +4 more
doaj +1 more source
Characterization of Line-Consistent Signed Graphs
Discussiones 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
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
Graph-based implicit knowledge discovery from architecture change logs [PDF]
, 2012 Service architectures continuously evolve as a consequence of frequent business and technical change cycles. Architecture change log data represents a source of evolution-centric information in terms of intent, scope and operationalisation to ...
Pooyan Jamshidi (5276344) +12 more
core +2 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
, 2013 In this paper, the concept of Total semirelib graph of a planar graph is introduced. Authors present a characterization of those graphs whose total semirelib graphs are planar, outer planar, Eulerian, hamiltonian with crossing number ...
Prasad, Manjunath +3 more
core +1 more source
Pragmatic Graph Rewriting Modifications [PDF]
, 1999 We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host graph, where nodes specified as 'Once Only' in the LHS of a rewrite match ...
Rodgers, Peter +3 more
core +1 more source