Results 21 to 30 of about 142,988 (312)
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
A Class of semisymmetric graphs
Ars Mathematica Contemporanea, 2013 A simple undirected graph is said to be semisymmetric if it is regular and edge-transitive but not vertex-transitive. Every semisymmetric graph is a bipartite graph with two parts of equal size. Let p be a prime. In this paper, a class of semisymmetric graphs of order 2 p 3 are determined.
Du, Shao Fei, Li, Xuewen, Wang, Li
openaire +3 more sources
, 2009 For standard terminology and notion in graph theory we refer the reader to Harary [7]; the non-standard will be given in this paper as and when required.
Reddy, P. Siva Kota +3 more
core +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
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
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
Smarandache-Zagreb Index on Three Graph Operators [PDF]
, 2010 Many researchers have studied several operators on a connected graph in which one make an attempt on subdivision of its edges. In this paper, we show how the Zagreb indices, a particular case of Smarandache-Zagreb index of a graph changes with these ...
Ranjini, P.S., Lokesha, V.
core +1 more source
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
Testing first-order properties for subclasses of sparse graphs [PDF]
, 2013 We present a linear-time algorithm for deciding first-order (FO) properties in classes of graphs with bounded expansion, a notion recently introduced by Nešetřil and Ossona de Mendez.
Thomas, Robin +2 more
core +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 +3 more sources