Results 41 to 50 of about 795,931 (124)
Edge Irregular Reflexive Labeling for the Disjoint Union of Gear Graphs and Prism Graphs
Mathematics, 2018 In graph theory, a graph is given names—generally a whole number—to edges, vertices, or both in a chart. Formally, given a graph G = ( V , E ) , a vertex naming is a capacity from V to an arrangement of marks.
Xiujun Zhang +3 more
doaj +1 more source
A New Type-2 Soft Set: Type-2 Soft Graphs and Their Applications
Advances in Fuzzy Systems, 2017 The correspondence between a vertex and its neighbors has an essential role in the structure of a graph. Type-2 soft sets are also based on the correspondence of primary parameters and underlying parameters.
Khizar Hayat +3 more
doaj +1 more source
The Reformulated F-Index of Vertex and Edge F-Join of Graphs
Journal of Chemistry, 2022 The valency based topological indices (TIs) are defined by algebraic functions as the chemical graph theory tools in which the structural parameters are used as input and the output is related with the topology of chemical species.
Durbar Maji +2 more
doaj +1 more source
High-girth near-Ramanujan graphs with lossy vertex expansion [PDF]
arXiv, 2020 Kahale proved that linear sized sets in $d$-regular Ramanujan graphs have vertex expansion $\sim\frac{d}{2}$ and complemented this with construction of near-Ramanujan graphs with vertex expansion no better than $\frac{d}{2}$. However, the construction of Kahale encounters highly local obstructions to better vertex expansion.
arxiv
“Follow the Leader”: A Centrality Guided Clustering and Its Application to Social Network Analysis
The Scientific World Journal, 2013 Within graph theory and network analysis, centrality of a vertex measures the relative importance of a vertex within a graph. The centrality plays key role in network analysis and has been widely studied using different methods.
Qin Wu +3 more
doaj +1 more source
The forwarding indices of graphs - a survey [PDF]
Opuscula Mathematica, 2013 A routing \(R\) of a connected graph \(G\) of order \(n\) is a collection of \(n(n-1)\) simple paths connecting every ordered pair of vertices of \(G\).
Jun-Ming Xu, Min Xu
doaj +1 more source
A complete characterisation of vertex-multiplications of trees with diameter 5 [PDF]
Theory Appl. Graphs, 8, (2021), Article 6, 2020 Koh and Tay introduced a new family of graphs, $G$ vertex-multiplications, as an extension of complete $n$-partite graphs. They proved a fundamental classification of $G$ vertex-multiplications into three classes $\mathscr{C}_0, \mathscr{C}_1$ and $\mathscr{C}_2$.
arxiv
A Survey on the Cyclic Coloring and its Relaxations
Discussiones Mathematicae Graph Theory, 2021 A cyclic coloring of a plane graph is a vertex coloring such that any two vertices incident with the same face receive distinct colors. This type of coloring was introduced more than fifty years ago, and a lot of research in chromatic graph theory was ...
Czap Július +2 more
doaj +1 more source
Two comments on balls in vertex transitive graphs [PDF]
arXiv, 2018 We observe that a ball of radius $1$ in the grandfather graph can not be realized as a ball of radius $1$ in a finite vertex transitive graph. We remark on when a ball in a finite vertex transitive graph appears as a ball in an infinite vertex transitive graph.
arxiv
-labeling of supersubdivided connected graph plus an edge
AKCE International Journal of Graphs and Combinatorics, 2020 Rosa, in his classical paper (Rosa, 1967) introduced a hierarchical series of labelings called and labeling as a tool to settle Ringel’s Conjecture which states that if is any tree with edges then the complete graph can be decomposed into copies of ...
G. Sethuraman, M. Sujasree
doaj +1 more source