Results 21 to 30 of about 7,350,988 (308)
Attachment Centrality for Weighted Graphs [PDF]
Measuring how central nodes are in terms of connecting a network has recently received increasing attention in the literature. While a few dedicated centrality measures have been proposed, Skibski et al. [2016] showed that the Attachment Centrality is the only one that satisfies certain natural axioms desirable for connectivity.
Sosnowska, Jadwiga, Skibski, Oskar
openaire +2 more sources
Pragmatic Graph Rewriting Modifications [PDF]
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
ACHROMATIC COLORING OF QUADRILATERAL SNAKES
The Main objective of this article is to discuss achromatic coloring and to investigate the achromatic number of the central graph of quadrilateral snake, double quadrilateral snake, triple quadrilateral snake, k-quadrilateral snake, alternate ...
Yashwant Panwar, Akhlak Mansurı
doaj
An Heuristic For Graph Symmetry Detection [PDF]
. We give a short introduction to an heuristic to find automorphisms in a graph such as axial, central or rotational symmetries. Using technics of factorial analysis, we embed the graph in an Euclidean space and try to detect and interpret the geometric ...
Hubert De Fraysseix +1 more
core +1 more source
Tulgeity of Line, Middle and Total Graph of Wheel Graph Families [PDF]
Tulgeity r(G) is the maximum number of disjoint, point induced, non acyclic subgraphs contained in G. In this paper one finds the tulgeity of line, middle and total graph of wheel graph, Gear graph and Helm ...
Vernold, Vivin +2 more
core +1 more source
Commuting Conjugacy Class Graph of G when G / Z(G)~=D2n [PDF]
Suppose G is a finite non-abelian group and Γ(G) is a simple graph with the non-central conjugacy classes of G as its vertex set. Two different noncentral conjugacy classes C and B are assumed to be adjacent in Γ(G) if and only if there are elements a ...
Mohammad Ali Salahshour
doaj +1 more source
Genus Distribution for a Graph [PDF]
In this paper we develop the technique of a distribution decomposition for a graph. A formula is given to determine genus distribution of a cubic graph.
Liangxia, Wan +2 more
core +1 more source
Commuting graphs and extremal centralizers
We determine the conditions for matrix centralizers which can guarantee the connectedness of the commuting graph for the full matrix algebra M n ( F ) over an arbitrary field F . It is known that if F is an algebraically closed field and n ≥ 3 , then the diameter of the commuting graph of M n ( F ) is always equal to four.
Dolinar, Gregor +3 more
openaire +5 more sources
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
The proposed work uses centrality measures based heuristic method to improve the efficiency of the solution for the similarity search problem in molecular chemical graphs by effectively identifying central candidate or representative candidate nodes ...
Nirmala Parisutham
doaj +1 more source

