Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Some necessary and sufficient conditions for diophantine graphs
View through CrossRef
A graph G of order n is called Diophantine if there exists a labeling function f of vertices such that gcd(f(u),f(v)) divides n for every pair adjacent vertices u,v in G. This paper defines, studies and generalizes maximal Diophantine graphs Dn, determining their independence number, number of full-degree vertices, and clique number. These parameters establish necessary conditions for the existence of Diophantine labelings.
Vertex Academic Press
Title: Some necessary and sufficient conditions for diophantine graphs
Description:
A graph G of order n is called Diophantine if there exists a labeling function f of vertices such that gcd(f(u),f(v)) divides n for every pair adjacent vertices u,v in G.
This paper defines, studies and generalizes maximal Diophantine graphs Dn, determining their independence number, number of full-degree vertices, and clique number.
These parameters establish necessary conditions for the existence of Diophantine labelings.
Related Results
Weakly Modular Graphs and Nonpositive Curvature
Weakly Modular Graphs and Nonpositive Curvature
This article investigates structural, geometrical, and topological characterizations and properties of weakly modular graphs and of cell complexes derived from them. The unifying t...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Abstract
Chordal graphs are characterized as the intersection graphs of subtrees in a tree and such a representation is known as the tree model. Restricting the characteriz...
On the reciprocal distance spectrum of edge corona of graphs
On the reciprocal distance spectrum of edge corona of graphs
The reciprocal distance spectrum (Harary spectrum) of a connected graph [Formula: see text] is the multiset of eigenvalues of its reciprocal distance matrix (Harary matrix) [Formul...
Analysis of discrete algorithms using the Diophantine equations for efficient problem solving
Analysis of discrete algorithms using the Diophantine equations for efficient problem solving
This paper looks at how Diophantine equations can be used to analyze and improve discrete algorithms so that they can solve problems more quickly. Finding integer answers to polyno...
Computing the Energy of Certain Graphs based on Vertex Status
Computing the Energy of Certain Graphs based on Vertex Status
Background:
The concept of Hückel molecular orbital theory is used to compute the graph energy numerically and graphically on the base of the status of a vertex.
Objective:
Our a...
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
The area of Data Analytics on graphs promises a paradigm shift, as we approach information processing of new classes of data which are typically acquired on irregular but structure...