Results 21 to 30 of about 3,952,319 (243)
Domination-Related Parameters in Rooted Product Graphs [PDF]
Bulletin of the Malaysian Mathematical Sciences Society, 2015 A set $S$ of vertices of a graph $G$ is a dominating set in $G$ if every vertex outside of $S$ is adjacent to at least one vertex belonging to $S$. A domination parameter of $G$ is related to those sets of vertices of a graph satisfying some domination property together with other conditions on the vertices of $G$.
Kuziak, Dorota +2 more
openaire +2 more sources
Experimental and bond graph based sensitivity calculations for micro-scale robust engineering design [PDF]
, 2005 Copyright @ 2005 IEEEBond graph modeling and sensitivity analysis are used to provide a platform for the robust design of a small mechatronic device, a behind-the-ear (BTE) hearing aid.
Wynn, HP +5 more
core +6 more sources
Strong metric dimension of rooted product graphs [PDF]
International Journal of Computer Mathematics, 2015 16 pages.
Dorota Kuziak +2 more
openaire +3 more sources
, 2021 In mathematics, a graph product is a binary operation on a graph. Graph products have been extensively researched and have many important applications in many fields. Here we discuss one graph-theoretical product.
Süleyman Ediz +9 more
core +1 more source
Dilation theory for rank two graph algebras. [PDF]
, 2010 An analysis is given of $*$-representations of rank 2 single vertex graphs. We develop dilation theory for the non-selfadjoint algebras $\A_\theta$ and $\A_u$ which are associated with the commutation relation permutation $\theta$ of a 2-graph and, more ...
Yang, Dilian +2 more
core +4 more sources
On the Additively Weighted Harary Index of Some Composite Graphs
Mathematics, 2017 The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. The additively weighted Harary index H A ( G ) is a modification of the Harary index in which the contributions of vertex ...
Behrooz Khosravi, Elnaz Ramezani
doaj +1 more source
The general position problem and strong resolving graphs
Open Mathematics, 2019 The general position number gp(G) of a connected graph G is the cardinality of a largest set S of vertices such that no three pairwise distinct vertices from S lie on a common geodesic.
Klavžar Sandi, Yero Ismael G.
doaj +1 more source
Antimagic Labeling for Product of Regular Graphs
, 2022 An antimagic labeling of a graph G=(V,E) is a bijection from the set of edges of G to 1,2,⋯,E(G) and such that any two vertices of G have distinct vertex sums where the vertex sum of a vertex v in V(G) is nothing but the sum of all the incident ...
Vinothkumar Latchoumanane +1 more
core +1 more source
VERTEX-ECCENTRICITY DESCRIPTORS IN DENDRIMERS
Studia Universitatis Babes-Bolyai Chemia, 2017 In this paper, we present graph theoretical methods to compute several vertex-eccentricity-based molecular descriptors such as the eccentric connectivity index, total eccentricity, average eccentricity and first and second Zagreb eccentricity indices ...
Mahdieh AZARI +2 more
doaj +1 more source
Methods for Computing Genus Distribution Using Double-Rooted Graphs [PDF]
, 2012 This thesis develops general methods for computing the genus distribution of various types of graph families, using the concept of double-rooted graphs, which are defined to be graphs with two vertices designated as roots (the methods developed in this ...
Khan, Imran Farid
core +1 more source