Results 21 to 30 of about 199,356 (251)
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
A paradigmatic approach to investigate restricted hyper totient graphs
Nowadays, the problem of finding families of graphs for which one may ensure the existence of a vertex-labeling and/or an edge-labeling based on a certain class of integers, constitutes a challenge for researchers in both number and graph theory. In this
Shahbaz Ali+2 more
doaj +1 more source
Fast branching algorithm for Cluster Vertex Deletion [PDF]
In the family of clustering problems, we are given a set of objects (vertices of the graph), together with some observed pairwise similarities (edges).
A. Ben-Dor+25 more
core +2 more sources
On vertex and edge degree-based topological indices
Introduction/purpose: The entire topological indices (T Ient) are a class of graph invariants depending on the degrees of vertices and edges. Some general properties of these invariants are established.
Ivan Gutman
doaj +1 more source
Transitive Triangle Tilings in Oriented Graphs [PDF]
In this paper, we prove an analogue of Corr\'adi and Hajnal's classical theorem. There exists $n_0$ such that for every $n \in 3\mathbb{Z}$ when $n \ge n_0$ the following holds.
Balogh, József+2 more
core +2 more sources
Connectivity Index in Vague Graphs with Application in Construction
The vague graph (VG), which has recently gained a place in the family of fuzzy graph (FG), has shown good capabilities in the face of problems that cannot be expressed by fuzzy graphs and interval-valued fuzzy graphs. Connectivity index (CI) in graphs is
Huiqin Jiang, Yongsheng Rao
doaj +1 more source
Connectivity Analysis of Cyclically Balanced Fuzzy Graphs
The concepts of connectivity and cycle connectivity play an important role in fuzzy graph theory. In this article, cyclic cutvertices, cyclic bridges and cyclically balanced fuzzy graphs are discussed.
N. Jicy, Sunil Mathew
doaj +1 more source
From Time–Frequency to Vertex–Frequency and Back
The paper presents an analysis and overview of vertex–frequency analysis, an emerging area in graph signal processing. A strong formal link of this area to classical time–frequency analysis is provided.
Ljubiša Stanković+5 more
doaj +1 more source
On the Vertex-Connectivity of an Uncertain Random Graph
In many practical problems, randomness and uncertainty simultaneously appear in one complex system or network. When graph theory is applied to these problems, these complex systems or networks are usually represented by uncertain random graphs, in which ...
Hao Li, Xin Gao
doaj +1 more source
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths [PDF]
When can a plane graph with prescribed edge lengths and prescribed angles (from among $\{0,180^\circ, 360^\circ$\}) be folded flat to lie in an infinitesimally thin line, without crossings?
Abel, Zachary+5 more
core +2 more sources