Results 101 to 110 of about 1,080,603 (189)
A Note on Graphs with Prescribed Orbit Structure
Entropy, 2019 This paper presents a proof of the existence of connected, undirected graphs with prescribed orbit structure, giving an explicit construction procedure for these graphs. Trees with prescribed orbit structure are also investigated.
Abbe Mowshowitz +2 more
doaj +1 more source
, 2011 A graph that admits a Smarandachely super mean m-labeling is called a Smarandachely super m-mean graph, particularly, a mean graph if m = 2. In this paper, some new families of mean graphs are investigated.
Vaidya, S.K.
core +1 more source
The Pictorial–Semantic–Task Framework for Understanding Graph Comprehension
Journal of IntelligenceGraphs are used in school, many occupations, and daily life, yet many people struggle to interpret them accurately. To help identify sources of difficulty in graph comprehension, we propose the Pictorial–Semantic–Task Framework.
Evelyn Hsin-I Tsai +2 more
doaj +1 more source
Coalition structure generation over graphs [PDF]
, 2012 We give the analysis of the computational complexity of coalition structure generation over graphs. Given an undirected graph G = (N,E) and a valuation function v : P(N) → R over the subsets of nodes, the problem is to find a partition of N into ...
Polukarov, Maria +5 more
core +1 more source
More about Divisible Design Graphs [PDF]
: Divisible design graphs (DDG for short) have been recently defined by Kharaghani, Meulenberg and the second author as a generalization of (v, k, λ)-graphs.
Haemers, W.H., Crnkovic, D.
core
Hamiltonian Strongly Regular Graphs [PDF]
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Petersen graph is the only connected non-Hamiltonian strongly regular graph on fewer than 99 vertices.Distance-regular graphs;Hamilton cycles JEL ...
Brouwer, A.E., Haemers, W.H.
core
Regular graphs with four eigenvalues [PDF]
We study the connected regular graphs with four distinct eigenvalues. Properties and feasibility conditions of the eigenvalues are found. Several examples, constructions and characterizations are given, as well as some uniqueness and nonexistence results.
Dam, E.R. van
core
Consensus Strategies for Signed Profiles on Graphs [PDF]
The median problem is a classical problem in Location Theory: one searches for a location that minimizes the average distance to the sites of the clients. This is for desired facilities as a distribution center for a set of warehouses. More recently, for
Changat, M. +3 more
core
Transit functions on graphs (and posets) [PDF]
The notion of transit function is introduced to present a unifying approachfor results and ideas on intervals, convexities and betweenness in graphs andposets.
Mulder, H.M.
core
Cospectral Graphs and the Generalized Adjacency Matrix [PDF]
AMS classifications: 05C50; 05E99;cospectral graphs;generalized spectrum;generalized adjacency ...
Koolen, J.H. +2 more
core