Results 21 to 30 of about 1,814,953 (245)
The uniqueness of DMAX-matrix graph invariants. [PDF]
PLoS ONE, 2014 In this paper, we examine the uniqueness (discrimination power) of a newly proposed graph invariant based on the matrix DMAX defined by Randić et al. In order to do so, we use exhaustively generated graphs instead of special graph classes such as trees ...
Matthias Dehmer, Yongtang Shi
doaj +1 more source
On equitable near-proper coloring of some derived graph classes
Karpatsʹkì Matematičnì Publìkacìï, 2022 An equitable near-proper coloring of a graph $G$ is a defective coloring in which the number of vertices in any two color classes differ by at most one and the bad edges obtained is minimized by restricting the number of color classes that can have ...
S. Jose, S. Naduvath
doaj +1 more source
General, General Weak, Anti, Balanced, and Semi-Neutrosophic Graph [PDF]
Neutrosophic Sets and SystemsGraph classes categorize graphs based on shared properties or structures, and numerous such classes have been proposed over time. In 1965, Zadeh [43] introduced a framework for managing uncertainty, which later inspired Rosenfeld [28, 31] to develop ...
Takaaki Fujita , Florentin Smarandache
doaj +1 more source
A Note Concerning Hamilton Cycles in Some Classes of Grid Graphs
Journal of Mathematical and Fundamental Sciences, 2013 A graph G is called hamiltonian if it contains a Hamilton cycle, i.e. a cycle containing all vertices. Deciding whether a given graph has a Hamilton cycle is an NP-complete problem. But, it is a polynomial problem within some special graph classes.
A. N.M. Salman +2 more
doaj +1 more source
On a class of intersection graphs
CoRR, 2013 Given a directed graph D = (V,A) we define its intersection graph I(D) = (A,E) to be the graph having A as a node-set and two nodes of I(D) are adjacent if their corresponding arcs share a common node that is the tail of at least one of these arcs. We call these graphs facility location graphs since they arise from the classical uncapacitated facility ...
Baïou, Mourad +3 more
openaire +4 more sources
COMPARISON AND ENUMERATION OF CHEMICAL GRAPHS
Computational and Structural Biotechnology Journal, 2013 Chemical compounds are usually represented as graph structured data in computers. In this review article, we overview several graph classes relevant to chemical compounds and the computational complexities of several fundamental problems for these graph ...
Tatsuya Akutsu, Hiroshi Nagamochi
doaj +3 more sources
On Generalizations of Pairwise Compatibility Graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceA graph $G$ is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree and an interval $I$, such that each leaf of the tree is a vertex of the graph, and there is an edge $\{ x, y \}$ in $G$ if and only if the weight of the path in the
Tiziana Calamoneri +3 more
doaj +1 more source
Substitution-closed pattern classes [PDF]
, 2011 The substitution closure of a pattern class is the class of all permutations obtained by repeated substitution. The principal pattern classes (those defined by a single restriction) whose substitution closure can be defined by a finite number of ...
Atkinson, M.D. +7 more
core +1 more source
On Strict (Outer-)Confluent Graphs
Journal of Graph Algorithms and Applications, 2021 A strict confluent (SC) graph drawing is a drawing of a graph with vertices as points in the plane, where vertex adjacencies are represented not by individual curves but rather by unique smooth paths through a planar system of junctions and arcs.
Henry Förster +3 more
doaj +1 more source
Genus Distribution for a Graph [PDF]
, 2009 In this paper we develop the technique of a distribution decomposition for a graph. A formula is given to determine genus distribution of a cubic graph.
Liangxia, Wan +2 more
core +1 more source