Results 21 to 30 of about 808 (83)
J-coloring of graph operations
Acta Universitatis Sapientiae: Informatica, 2019 A vertex v of a given graph is said to be in a rainbow neighbourhood of G if every color class of G consists of at least one vertex from the closed neighbourhood N[v].
Naduvath Sudev, Kok Johan
doaj +1 more source
The obstructions for toroidal graphs with no $K_{3,3}$'s [PDF]
, 2005 Forbidden minors and subdivisions for toroidal graphs are numerous. We consider the toroidal graphs with no $K_{3,3}$-subdivisions that coincide with the toroidal graphs with no $K_{3,3}$-minors.
Andrei Gagarin +23 more
core +3 more sources
Characterizing symmetric diametrical graphs of order 12 and diameter 4
International Journal of Mathematics and Mathematical Sciences, Volume 30, Issue 3, Page 145-149, 2002., 2002 A diametrical graph G is said to be symmetric if d(u,v)+d(v,u¯)=d(G) for all u, v ∈ V(G), where u¯ is the buddy of u. If moreover, G is bipartite, then it is called an S‐graph. It would be shown that the Cartesian product K2 × C6 is not only the unique S‐graph of order 12 and diameter 4, but also the unique symmetric diametrical graph of order 12 and ...
S. Al-Addasi, H. Al-Ezeh
wiley +1 more source
On Accurate Domination in Graphs
Discussiones Mathematicae Graph Theory, 2019 A dominating set of a graph G is a subset D ⊆ VG such that every vertex not in D is adjacent to at least one vertex in D. The cardinality of a smallest dominating set of G, denoted by γ(G), is the domination number of G. The accurate domination number of
Cyman Joanna +2 more
doaj +1 more source
On the Genus of the Idempotent Graph of a Finite Commutative Ring
Discussiones Mathematicae - General Algebra and Applications, 2021 Let R be a finite commutative ring with identity. The idempotent graph of R is the simple undirected graph I(R) with vertex set, the set of all nontrivial idempotents of R and two distinct vertices x and y are adjacent if and only if xy = 0.
Belsi G. Gold, Kavitha S., Selvakumar K.
doaj +1 more source
LIMITING PROBABILITY TRANSITION MATRIX OF A CONDENSED FIBONACCI TREE
, 2018 This paper discusses on the construction of condensed Fibonacci trees and present the Markov chain corresponding to the condensed Fibonacci trees. An n × n finite Markov probability transition matrix for this Markov chain is presented and it is proved ...
K. A. Germina
semanticscholar +1 more source
Equimatchable Bipartite Graphs
Discussiones Mathematicae Graph Theory, 2023 A graph is called equimatchable if all of its maximal matchings have the same size. Lesk et al. [Equi-matchable graphs, Graph Theory and Combinatorics (Academic Press, London, 1984) 239–254] has provided a characterization of equimatchable bipartite ...
Büyükçolak Yasemin +2 more
doaj +1 more source
An upper bound of the basis number of the semi-strong product of bipartite graphs
SUT Journal of Mathematics, 2005 A basis of the cycle space, C(G), of a graph G is called a d-fold if each edge of G occurs in at most d cycles of the basis. The basis number, b(G), of a graph G is defined to be the least integer d such that G has a d-fold basis for its cycle space ...
M. Jaradat
semanticscholar +1 more source
Existence of Regular Nut Graphs for Degree at Most 11
Discussiones Mathematicae Graph Theory, 2020 A nut graph is a singular graph with one-dimensional kernel and corresponding eigenvector with no zero elements. The problem of determining the orders n for which d-regular nut graphs exist was recently posed by Gauci, Pisanski and Sciriha.
Fowler Patrick W. +4 more
doaj +1 more source
ON ZAGREB INDICES AND ECCENTRIC CONNECTIVITY INDEX OF CERTAIN THORN GRAPHS
, 2016 The first three Zagreb indices of a graph G denoted, M1(G),M2(G) and M3(G), are well known. Equally well known is the eccentricity connectivity index denoted, ξ(G).
U. Mary +4 more
semanticscholar +1 more source