Results 41 to 50 of about 5,251,465 (203)
Resolving sets of vertices with the minimum size in graphs [PDF]
Suppose that $G$ is a simple connected graph with vertex set $V(G)$ and edge set $E(G)$. A subset $S=\{s_1, s_2,\ldots , s_l \}$ of vertices of graph $G$ is called a doubly resolving set of $G$, if for any distinct vertices $u$ and $v$ in $G$ there are ...
Ali Zafari, Nader Habibi, Saeid Alikhani
doaj +1 more source
The infimum of the least eigenvalues of all finite induced subgraphs of an infinite graph is defined to be its least eigenvalue. In [P.J. Cameron, J.M. Goethals, J.J. Seidel and E.E. Shult, Line graphs, root systems, and elliptic geometry, J. Algebra 43 (
Vijayakumar Gurusamy Rengasamy
doaj +1 more source
Construction and analysis of graph models for multiprocessor interconnection networks [PDF]
A graph G can serve as a model for the Multiprocessor Interconnection Networks (MINs) in which the vertices represent the processors, while the edges represent connections between processors.
Hegde S.M., Saumya Y.M.
doaj +1 more source
Graph equations for line graphs and total graphs
AbstractAll pairs (G,H) of graphs G,H satisfying L(G) = T(H) are determined. The “graph equation“ L(G)= T(H) is also solved.
Dragos M. Cvetkovic, Slobodan K. Simic
openaire +2 more sources
On Pathos Total Semitotal and Entire Total Block Graph of a Tree [PDF]
In this communication, the concept of pathos total semitotal and entire total block graph of a tree is introduced. Its study is concentrated only on trees.
Syed Babajan +2 more
core +1 more source
In this paper, we introduce ideal graph of a graph and study some of its properties. We characterize connectedness, isomorphism of graphs and coloring property of a graph using ideal graph.
Manoharan, R., Vasuki, R.
core +1 more source
Towards a Maude tool for model checking temporal graph properties [PDF]
We present our prototypical tool for the verification of graph transformation systems. The major novelty of our tool is that it provides a model checker for temporal graph properties based on counterpart semantics for quantified m-calculi.
Lluch-Lafuente, Alberto +4 more
core +1 more source
The study of line graphs of subdivision graphs of some rooted product graphs via K-Banhatti indices
The degree-based topological indices are numerical graph invariants that are used to link a molecule’s structural characteristics to its physical, and chemical characteristics.
K. J. Gowtham, N. Narahari
doaj +1 more source
A graph rewriting programming language for graph drawing [PDF]
This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process.
Rodgers, Peter
core +1 more source
Some Properties of Regular Line Graphs
In this paper, the concept of regular line graph has been introduced. The maximum number of vertices with different degrees in the regular line graphs has also been studied.
Akram Attar
doaj +4 more sources

