Results 1 to 10 of about 196,098 (89)

On almost hypohamiltonian graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2019
A graph $G$ is almost hypohamiltonian (a.h.) if $G$ is non-hamiltonian, there exists a vertex $w$ in $G$ such that $G - w$ is non-hamiltonian, and $G - v$ is hamiltonian for every vertex $v \ne w$ in $G$. The second author asked in [J.
Jan Goedgebeur, Carol T. Zamfirescu
doaj   +6 more sources

Relating graph energy with vertex-degree-based energies [PDF]

open access: yesVojnotehnički Glasnik, 2020
Introduction/purpose: The paper presents numerous vertex-degree-based graph invariants considered in the literature. A matrix can be associated to each of these invariants.
Ivan Gutman
doaj   +1 more source

Graph pebbling number and model [PDF]

open access: yesریاضی و جامعه, 2023
There are many topics in graph theory that can be called ``moving objects around a graph". For example; In network optimization, shipments are transferred from some vertices (resources) to other vertices (demand) according to the costs allocated to the ...
Fatemeh Aghaei Meybodi, Saeed Alikhani
doaj   +1 more source

ALGORITMO DE COBERTURA DE VÉRTICES

open access: yesRevista Ingeniería, Matemáticas y Ciencias de la Información, 2023
Problem to solve P=NP, using the coverage problem of a graph that is NP and convert it to P. In the mathematicaldiscipline of graph theory, a vertex cover, simply a graph cover, is a set of vertices such that each edge of the graph isincident to at least
Javier López Wong
doaj   +1 more source

Sampling theory of jointly bandlimited time-vertex graph signals

open access: yesSignal Processing, 2023
Time-vertex graph signal (TVGS) models describe time-varying data with irregular structures. The bandlimitedness in the joint time-vertex Fourier spectral domain reflects smoothness in both temporal and graph topology. In this paper, we study the critical sampling of three types of TVGS including continuous-time signals, infinite-length sequences, and ...
Hang Sheng   +4 more
openaire   +2 more sources

Note on the temperature Sombor index

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

DETERMINATION OF THE RESTRAINED DOMINATION NUMBER ON VERTEX AMALGAMATION AND EDGE AMALGAMATION OF THE PATH GRAPH WITH THE SAME ORDER

open access: yesBarekeng, 2022
Graph theory is a mathematics section that studies discrete objects. One of the concepts studied in graph theory is the restrained dominating set which aims to find the restrained dominating number.
Landerius Maro   +2 more
doaj   +1 more source

New Concepts of Vertex Covering in Cubic Graphs with Its Applications

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

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

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

Home - About - Disclaimer - Privacy