Results 11 to 20 of about 187,749 (326)

On the Distribution of Vertex Energy of Connected Non-Regular Non-Bipartite Integral Graphs with Maximum Vertex Degree Four [PDF]

Scientific Annals of Computer Science
The energy of a vertex in a graph plays a very important role in terms of its contribution to the total energy of a graph, a significant graph invariant in the field of chemical graph theory.
P. N. Simha, B. P. Shylaja, N. Narahari, H. M. Nagesh, U. V. C. Kumar   +4 more
doaj   +2 more sources

On the vertex position number of graphs [PDF]

Discussiones Mathematicae Graph Theory, 2022
In this paper we generalise the notion of visibility from a point in an integer lattice to the setting of graph theory. For a vertex $x$ of a connected graph $G$, we say that a set $S \subseteq V(G)$ is an \emph{$x$-position set} if for any $y \in S$ the
Maya G. S. Thankachy, Ullas Chandran S.V., J. Tuite, E. Thomas, Gabriele Di Stefano, G. Erskine   +5 more
semanticscholar   +4 more sources

An Improved Algorithm for Identification of Dominating Vertex Set in Intuitionistic Fuzzy Graphs

Axioms, 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, Tanzeela Shaheen, LeSheng Jin, Tapan Senapati   +3 more
doaj   +1 more source

Theory and Design of Joint Time-Vertex Nonsubsampled Filter Banks

IEEE Transactions on Signal Processing, 2021
Graph signal processing (GSP) is a field that deals with data residing on irregular domains, i.e. graph signals. In this field, the graph filter bank is one of the most important developments, owing to its ability to provide multiresolution analysis of ...
Junzheng Jiang, Hairong Feng, David B. H. Tay, Shu-wen Xu   +3 more
semanticscholar   +1 more source

On the spectral radius of VDB graph matrices

Vojnotehnič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

Flipper games for monadically stable graph classes [PDF]

International Colloquium on Automata, Languages and Programming, 2023
A class of graphs $\mathscr{C}$ is monadically stable if for any unary expansion $\widehat{\mathscr{C}}$ of $\mathscr{C}$, one cannot interpret, in first-order logic, arbitrarily long linear orders in graphs from $\widehat{\mathscr{C}}$. It is known that
Jakub Gajarsk'y, Nikolas Mahlmann, Rose McCarty, Pierre Ohlmann, Michał Pilipczuk, Wojciech Przybyszewski, S. Siebertz, Marek Sokołowski, Szymon Toruńczyk   +8 more
semanticscholar   +1 more source

Risk-Aware Identification of Highly Suspected COVID-19 Cases in Social IoT: A Joint Graph Theory and Reinforcement Learning Approach

IEEE Access, 2020
The recent outbreak of the coronavirus disease 2019 (COVID-19) has rapidly become a pandemic, which calls for prompt action in identifying suspected cases at an early stage through risk prediction.
Bowen Wang, Yanjing Sun, T. Duong, L. Nguyen, L. Hanzo   +4 more
semanticscholar   +1 more source

Virus Graph and COVID-19 Pandemic: A Graph Theory Approach

Big Data Analytics and Artificial Intelligence Against COVID-19: Innovation Vision and Approach, 2020
In the field of science and technology, the graph theory has offered several approaches to articulate any situation or concept. The use of graph theory enables the users to understand and visualize the situations like COVID-19.
H. Bhapkar, P. Mahalle, P. Dhotre
semanticscholar   +1 more source

Three conjectures in extremal spectral graph theory [PDF]

J. Comb. Theory B, 2016
We prove three conjectures regarding the maximization of spectral invariants over certain families of graphs. Our most difficult result is that the join of $P_2$ and $P_{n-2}$ is the unique graph of maximum spectral radius over all planar graphs.
Michael Tait, Josh Tobin
semanticscholar   +1 more source

Cheeger Inequalities for Vertex Expansion and Reweighted Eigenvalues [PDF]

IEEE Annual Symposium on Foundations of Computer Science, 2022
The classical Cheeger’s inequality relates the edge conductance of a graph and the second smallest eigenvalue of the Laplacian matrix. Recently, Olesker-Taylor and Zanetti discovered a Cheeger-type inequality connecting the vertex expansion of a graph ...
T. C. Kwok, L. Lau, Kam Chuen Tung
semanticscholar   +1 more source