Results 81 to 90 of about 153,964 (249)
Generalized inverses in graph theory
AKCE International Journal of Graphs and Combinatorics, 2023 –In this article, some interesting applications of generalized inverses in the graph theory are revisited. Interesting properties of generalized inverses are employed to make the proof of several known results simpler, and several techniques such as ...
Umashankara Kelathaya +2 more
doaj +1 more source
Matching graphs of Hypercubes and Complete Bipartite Graphs [PDF]
Electronic Notes in Discrete Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Tight Bounds for Hypercube Minor‐Universality
Journal of Graph Theory, EarlyView.ABSTRACT A graph G $G$ is m $m$‐minor‐universal if every graph H $H$ with at most m $m$ edges and no isolated vertices is contained as a minor in G $G$. Recently, Benjamini, Kalifa and Tzalik proved that there is an absolute constant c>0 $c\gt 0$ such that the d $d$‐dimensional hypercube Qd ${Q}_{d}$ is (c⋅2d/d $c\cdot {2}^{d}/d$)‐minor‐universal ...
Emma Hogan +5 more
wiley +1 more source
Nullity and Bounds to the Nullity of Dendrimer Graphs [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2013 In this paper, a high zero-sum weighting is applied to evaluate the nullity of a dendrimer graph for some special graphs such as cycles, paths, complete graphs, complete bipartite graphs and star graphs.
Khidir Sharaf, Didar Ali
doaj +1 more source
Detour Global Domination for Degree Splitting graphs of some graphs
Ratio Mathematica, 2023 In this paper, we introduced the new concept detour global domination number for degree splitting graph of standard graphs. The detour global dominating sets in some standard and special graphs are determined.
C. Jayasekaran, S.V. Ashwin Prakash
doaj +1 more source
Topological Symmetry Groups of Complete Bipartite Graphs [PDF]
, 2015 The symmetries of complex molecular structures can be modeled by the {\em topological symmetry group} of the underlying embedded graph. It is therefore important to understand which topological symmetry groups can be realized by particular abstract ...
Hake, Kathleen +2 more
core +2 more sources
Treewidth Versus Clique Number. V. Further Connections With Tree‐Independence Number
Journal of Graph Theory, EarlyView.ABSTRACT We continue the study of ( tw , ω ) $({\mathsf{tw}},\omega )$‐bounded graph classes, that is, hereditary graph classes in which large treewidth is witnessed by the presence of a large clique, and the relation of this property to boundedness of the tree‐independence number, a graph parameter introduced independently by Yolov in 2018 and by ...
Claire Hilaire +2 more
wiley +1 more source
Bipartite Diametrical Graphs of Diameter 4 and Extreme Orders
International Journal of Mathematics and Mathematical Sciences, 2008 We provide a process to extend any bipartite diametrical graph of diameter 4 to an 𝑆-graph of the same diameter and partite sets. For a bipartite diametrical graph of diameter 4 and partite sets 𝑈 and 𝑊, where 2𝑚=|𝑈|≤|𝑊|, we prove that 2𝑚 is a sharp ...
Salah Al-Addasi, Hasan Al-Ezeh
doaj +1 more source
Fuzzy dominator coloring on fuzzy soft graphs
Ratio Mathematica, 2023 A fuzzy soft dominator colouring of a fuzzy soft graph $G^S$(T,V) is an appropriate fuzzy soft colouring such that every single vertex of $G^S$(T,V) dominate entire vertex of a colour group.
Jahir Hussain Rasheed, Afya Farhana
doaj +1 more source
The IC-Indices of Complete Bipartite Graphs [PDF]
The Electronic Journal of Combinatorics, 2008 Let $G$ be a connected graph, and let $f$ be a function mapping $V(G)$ into ${\Bbb N}$. We define $f(H)=\sum_{v\in{V(H)}}f(v)$ for each subgraph $H$ of $G$. The function $f$ is called an IC-coloring of $G$ if for each integer $k$ in the set $\{1,2,\cdots,f(G)\}$ there exists an (induced) connected subgraph $H$ of $G$ such that $f(H)=k$, and the IC ...
Shiue, Chin-Lin, Fu, Hung-Lin
openaire +2 more sources