Results 241 to 250 of about 122,412 (281)
Adjacency Matrix of a Semigraph
Electronic Notes in Discrete Mathematics, 2017 Abstract Semigraph was defined by Sampathkumar as a generalization of a graph. In this paper the adjacency matrix which represents semigraph uniquely and a characterization of such a matrix is obtained. An algorithm to construct the semigraph from a given square matrix, if semigraphical is given.
Y. S. Gaidhani +2 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On the eigenvalue and energy of extended adjacency matrix
Applied Mathematics and Computation, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modjtaba Ghorbani +2 more
exaly +2 more sources
Membership Problem with Adjacency Matrix
Computación y Sistemas, 2021In this article, proposed a algorithm to solve the membership problem in Hyperedge Replacement Grammars (HRG). Given a hypergraph H with labeled nodes rooted and directed hyperedges, the problem consists in determining if H 2 L(G), where G is in HRG, this is to say, if H is in the language generated by G, for this the analysis is done directly in the ...
Yolanda Moyao Martínez +3 more
openaire +1 more source
A Compact Form of the Adjacency Matrix
Journal of Chemical Information and Computer Sciences, 2000It has been shown that the adjacency matrix can be transformed into a row vector and then into a single number. This number can again be decoded to recover the row vector, and this in turn can be decoded to restore the original adjacency matrix. A special, rather efficient coding scheme was devised for acyclic structures.
openaire +2 more sources
An algorithm for planarity testing by adjacency matrix
2012 International Conference on Machine Learning and Cybernetics, 2012It is of great use to determine whether a graph is planar in both information technology and engineering areas. Although there are some known algorithms, they are quite difficult to understand and to implement. This paper proposes a new method to determine the planarity of a graph by adjacency matrix, which is very easy to implement.
Shi-Qun Li, Qian-Li Ma
openaire +1 more source
Extended Adjacency Matrix Indices and Their Applications
Journal of Chemical Information and Computer Sciences, 1994In this paper, new topological indices, EA Sigma and EAmax, are introduced. They are based on the extended adjacency matrices of molecules, in which the influences of factors of heteroatoms and multiple bonds were considered.
Yiqiu Yang, Lu Xu, Chang-Yu Hu
openaire +1 more source
A visual canonical adjacency matrix for graphs
2009 IEEE Pacific Visualization Symposium, 2009Graph data mining algorithms rely on graph canonical forms to compare different graph structures. These canonical form definitions depend on node and edge labels. In this paper, we introduce a unique canonical visual matrix representation that only depends on a graph's topological information, so that two structurally identical graphs will have exactly
Hongli Li +2 more
openaire +1 more source
Data Clustering by Scaled Adjacency Matrix
2011Similarity based clustering, which is to find the extrinsic clusters in data by taking as input a collection of real-valued similarities between data points, has been playing an important role in data analysis and engineering. Lots of work had been done in this field.
Jian Yu 0001, Caiyan Jia
openaire +1 more source
On the adjacency matrix and the colouring of graphs
2001Summary: A planar graph, \(G\), can be drawn on a plane in such a way that no two edges intersect. It is said to be maximal planar if no edge can be added without losing planarity. Each vertex of an Eulerian graph is of even degree. We show that the chromatic number of a maximal planar graph is 3 if and only if it is Eulerian. From the adjacency matrix
MARINO, Maria Corinna, SCIRIHA I.
openaire +2 more sources
On two problems related to anti-adjacency (eccentricity) matrix
Discrete Applied Mathematics, 2023Håkan Kucuk
exaly