Results 41 to 50 of about 187,749 (326)

On Divided-Type Connectivity of Graphs

open access: yesEntropy, 2023
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

Smarandache-Zagreb Index on Three Graph Operators [PDF]

open access: yes, 2010
Many researchers have studied several operators on a connected graph in which one make an attempt on subdivision of its edges. In this paper, we show how the Zagreb indices, a particular case of Smarandache-Zagreb index of a graph changes with these ...
Ranjini, P.S., Lokesha, V.
core   +1 more source

On Degree-Based Topological Indices of Petersen Subdivision Graph

open access: yesEuropean Journal of Mathematical Analysis, 2023
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

Entire choosability of near-outerplane graphs [PDF]

open access: yes, 2008
It is proved that if G is a plane embedding of a K4-minor-free graph with maximum degree Δ, then G is entirely 7-choosable if Δ≤4 and G is entirely (Δ+ 2)-choosable if Δ≥ 5; that is, if every vertex, edge and face of G is given a list of max{7,Δ+2 ...
Timothy J. Hetherington   +2 more
core   +1 more source

From Time–Frequency to Vertex–Frequency and Back

open access: yesMathematics, 2021
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

Connectivity Index in Vague Graphs with Application in Construction

open access: yesDiscrete Dynamics in Nature and Society, 2022
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

On vertex and edge degree-based topological indices

open access: yesVojnotehnički Glasnik, 2023
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

The Ramsey theory of the universal homogeneous triangle-free graph [PDF]

open access: yesJournal of Mathematical Logic, 2017
The universal homogeneous triangle-free graph, constructed by Henson [A family of countable homogeneous graphs, Pacific J. Math. 38(1) (1971) 69–83] and denoted [Formula: see text], is the triangle-free analogue of the Rado graph. While the Ramsey theory
Natasha Dobrinen
semanticscholar   +1 more source

On the conjunctive capacity of graphs [PDF]

open access: yes, 2013
The investigation of the asymptotic behaviour of various graph parameters in powers of a fixed graph G=(V,E) is motivated by problems in information theory and extremal ...
Chlebikova, Janka   +5 more
core   +1 more source

A New Approach Based on Centrality Value in Solving the Minimum Vertex Cover Problem: Malatya Centrality Algorithm

open access: yesComputer Science, 2022
The graph is a data structures and models that used to describe many real-world problems. Many engineering problems, such as safety and transportation, have a graph-like structure and are based on a similar model.
A. Karcı, Selman Yakut, Furkan Öztemiz
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy