Results 11 to 20 of about 989,435 (276)
Note on the temperature Sombor index
Introduction/purpose: The temperature of a vertex of a graph of the order n is defined as d/(n-d), where d is the vertex degree. The temperature variant of the Sombor index is investigated and several of its properties established. Methods: Combinatorial
Ivan Gutman
doaj +1 more source
New Concepts of Vertex Covering in Cubic Graphs with Its Applications
Graphs serve as one of the main tools for the mathematical modeling of various human problems. Fuzzy graphs have the ability to solve uncertain and ambiguous problems.
Huiqin Jiang+4 more
doaj +1 more source
An Improved Algorithm for Identification of Dominating Vertex Set in Intuitionistic Fuzzy Graphs
In graph theory, a “dominating vertex set” is a subset of vertices in a graph such that every vertex in the graph is either a member of the subset or adjacent to a member of the subset.
Nazia Nazir+3 more
doaj +1 more source
On the spectral radius of VDB graph matrices
Introduction/purpose: Vertex-degree-based (VDB) graph matrices form a special class of matrices, corresponding to the currently much investigated vertex-degree-based (VDB) graph invariants. Some spectral properties of these matrices are investigated.
Ivan Gutman
doaj +1 more source
Strong parity vertex coloring of plane graphs [PDF]
A strong parity vertex coloring of a 2-connected plane graph is a coloring of the vertices such that every face is incident with zero or an odd number of vertices of each color.
Tomas Kaiser+3 more
doaj +1 more source
Removing Symmetry in Circulant Graphs and Point-Block Incidence Graphs
An automorphism of a graph is a mapping of the vertices onto themselves such that connections between respective edges are preserved. A vertex v in a graph G is fixed if it is mapped to itself under every automorphism of G. The fixing number of a graph G
Josephine Brooks+5 more
doaj +1 more source
Some topological indices of pentagonal double chains [PDF]
In graph theory, lattices are used when some structural part of the graph repeats itself finitely or infinitely many times. They have applications in complex analysis and geometry in mathematics, and also natural applications in chemical graph theory. As
Mahalank Pushpalatha+4 more
doaj +1 more source
Computation of Resolvability Parameters for Benzenoid Hammer Graph
A representation of each vertex of a network into distance-based arbitrary tuple form, adding the condition of uniqueness of each vertex with reference to some settled vertices. Such settled vertices form a set known as resolving set.
Ali Ahmad, Al-Nashri Al-Hossain Ahmad
doaj +1 more source
On Divided-Type Connectivity of Graphs
The graph connectivity is a fundamental concept in graph theory. In particular, it plays a vital role in applications related to the modern interconnection graphs, e.g., it can be used to measure the vulnerability of the corresponding graph, and is an ...
Qiao Zhou, Xiaomin Wang, Bing Yao
doaj +1 more source
On Degree-Based Topological Indices of Petersen Subdivision Graph
In this paper, we adequately describe the generalised petersen graph, expanding to the categories of graphs. We created a petersen graph, which is cyclic and has vertices that are arranged in the centre and nine gons plus one vertex, leading to the ...
Mukhtar Ahmad+5 more
doaj +1 more source