18 research outputs found
Cacti with minimum, second-minimum, and third-minimum Kirchhoff indices
Resistance distance was introduced by Klein and
Randić. The Kirchhoff index Kf(G) of a graph G is the
sum of resistance distances between all pairs of vertices. A graph
G is called a cactus if each block of G is either an edge or a
cycle. Denote by Cat(n; t) the set of connected cacti possessing
n vertices and t cycles. In this paper, we give the first three
smallest Kirchhoff indices among graphs in Cat(n; t), and
characterize the corresponding extremal graphs as well
Efficiency and Betweenness Centrality of Graphs and some Applications
The distance between any two vertices and in a graph is the minimum number of edges in a path between and . If there is no path connecting and , then . In 2001, Latora and Marchiori introduced the measure of efficiency between vertices in a graph. The efficiency between two vertices and is defined to be for all . The textit{global efficiency} of a graph is the average efficiency over all . The {it power of a graph} is defined to be and . In this paper we determine the global efficiency for path power graphs , cycle power graphs , complete multipartite graphs , star and subdivided star graphs, and the Cartesian products , , , and .
The concept of global efficiency has been applied to optimization of transportation systems and brain connectivity. We show that star-like networks have a high level of efficiency. We apply these ideas to an analysis of the Metropolitan Atlanta Rapid Transit Authority (MARTA) Subway system, and show this network is 82% as efficient as a network where there is a direct line between every pair of stations. From BOLD fMRI scans we are able to partition the brain with consistency in terms of functionality and physical location. We also find that football players who suffer the largest number of high-energy impacts experience the largest drop in efficiency over a season.
Latora and Marchiori also presented two local properties. The textit{local efficiency} is the average of the global efficiencies over the subgraphs , the subgraph induced by the neighbors of . The clustering coefficient of a graph is defined to be where is a degree of completeness of . In this paper, we compare and contrast the two quantities, local efficiency and clustering coefficient.
Betweenness centrality is a measure of the importance of a vertex to the optimal paths in a graph. Betweenness centrality of a vertex is defined as where is the number of unique paths of shortest length between vertices and . is the number of optimal paths that include the vertex . In this paper, we examined betweenness centrality for vertices in . We also include results for subdivided star graphs and star graphs.
A graph is said to have unique betweenness centrality if implies : the betweenness centrality function is injective over the vertices of . We describe the betweenness centrality for vertices in ladder graphs, . An appended ladder graph is with a pendant vertex attached to an tbl endtbr. We conjecture that the infinite family of appended graphs has unique betweenness centrality
Advances in Discrete Applied Mathematics and Graph Theory
The present reprint contains twelve papers published in the Special Issue “Advances in Discrete Applied Mathematics and Graph Theory, 2021” of the MDPI Mathematics journal, which cover a wide range of topics connected to the theory and applications of Graph Theory and Discrete Applied Mathematics. The focus of the majority of papers is on recent advances in graph theory and applications in chemical graph theory. In particular, the topics studied include bipartite and multipartite Ramsey numbers, graph coloring and chromatic numbers, several varieties of domination (Double Roman, Quasi-Total Roman, Total 3-Roman) and two graph indices of interest in chemical graph theory (Sombor index, generalized ABC index), as well as hyperspaces of graphs and local inclusive distance vertex irregular graphs
Discrete Mathematics and Symmetry
Some of the most beautiful studies in Mathematics are related to Symmetry and Geometry. For this reason, we select here some contributions about such aspects and Discrete Geometry. As we know, Symmetry in a system means invariance of its elements under conditions of transformations. When we consider network structures, symmetry means invariance of adjacency of nodes under the permutations of node set. The graph isomorphism is an equivalence relation on the set of graphs. Therefore, it partitions the class of all graphs into equivalence classes. The underlying idea of isomorphism is that some objects have the same structure if we omit the individual character of their components. A set of graphs isomorphic to each other is denominated as an isomorphism class of graphs. The automorphism of a graph will be an isomorphism from G onto itself. The family of all automorphisms of a graph G is a permutation group