Results 1 to 10 of about 8,655 (234)
Upper and lower bounds based on linear programming for the b-coloring problem
EURO Journal on Computational Optimization, 2022 B-coloring is a problem in graph theory. It can model some real applications, as well as being used to enhance solution methods for the classical graph coloring problem. In turn, improved solutions for the classical coloring problem would impact a larger
Roberto Montemanni +2 more
doaj +1 more source
A Generalization of a Theorem of Diderrich in Additive Group Theory to Vertex-transitive Graphs
European Journal of Combinatorics, 1996 Consider a vertex-transitive (finite) directed graph \(X=(V,E)\). Let \(\kappa (X)\) be its connectivity number in directed sense. As known, each indegree and each outdegree in \(X\) equals \(|E|/ |X|\). Denote this number by \(d\). It is shown that \(d= \kappa (X)\) if there is no transitive triangle in \(X\).
openaire +2 more sources
THE LOCATING RAINBOW CONNECTION NUMBERS OF LOLLIPOP AND BARBELL GRAPHS
BarekengThe concept of the locating rainbow connection number of a graph is an innovation in graph coloring theory that combines the concepts of rainbow vertex coloring and partition dimension on graphs.
Ariestha Widyastuty Bustan +4 more
doaj +1 more source
A SURVEY M-POLAR FUZZY GRAPHS [PDF]
Fiabilitate şi Durabilitate, 2019 I will begin with the presentation of the basic definitions required for the development of this survey- graph. Rosenfeld [17] first introduced the concept of fuzzy graphs. After that fuzzy graph theory becomes a vast research area.
Iuliana Carmen BĂRBĂCIORU
doaj
On almost hypohamiltonian graphs [PDF]
Discrete 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 +1 more source
Iwasawa theory for vertex-weighted graphs
29 pages, 8 ...
Murooka, Ryosuke, Tateno, Sohei
openaire +2 more sources
Advancing Graph Theory with Genetic Algorithms: AFocus on Non-Inclusive Vertex Irregular Labeling
European Journal of Pure and Applied MathematicsNon-inclusive irregular vertex labeling is a labeling on a graph where the vertex labels are real numbers with weights. The weight is defined as the sum of the labels of the connected nodes. The main problem in labeling graphs is finding the formula to apply the required labeling rules.
Kiswara Agung Santoso +3 more
openaire +1 more source
Online Graph Topology Learning via Time-Vertex Adaptive Filters: From Theory to Cardiac Fibrillation
IEEE Transactions on Signal and Information Processing over NetworksGraph Signal Processing (GSP) provides a powerful framework for analysing complex, interconnected systems by modelling data as signals on graphs. While recent advances have enabled graph topology learning from observed signals, existing methods often struggle with time-varying systems and real-time applications. To address this gap, we introduce AdaCGP,
Alexander Jenkins +4 more
openaire +2 more sources
MathematicsThe incidence of edges on vertices is a cornerstone of graph theory, with profound implications for various graph properties and applications. Understanding degree distributions and their implications is crucial for analyzing and modeling real-world ...
A. R. Nagalakshmi +3 more
doaj +1 more source
Knots and Knot-Hyperpaths in Hypergraphs
Mathematics, 2022 This paper deals with some theoretical aspects of hypergraphs related to hyperpaths and hypertrees. In ordinary graph theory, the intersecting or adjacent edges contain exactly one vertex; however, in the case of hypergraph theory, the adjacent or ...
Saifur Rahman +3 more
doaj +1 more source