Results 81 to 90 of about 140,780 (247)
Energy of Certain Classes of Graphs Determined by Their Laplacian Degree Product Adjacency Spectrum
Journal of Mathematics, 2022 In this study, we investigate the Laplacian degree product spectrum and corresponding energy of four families of graphs, namely, complete graphs, complete bipartite graphs, friendship graphs, and corona products of 3 and 4 cycles with a null graph.
Asim Khurshid +3 more
doaj +1 more source
An Approach to the Girth Problem in Cubic Graphs
Journal of Graph Theory, EarlyView.ABSTRACT We offer a new, gradual approach to the largest girth problem for cubic graphs. It is easily observed that the largest possible girth of all n $n$‐vertex cubic graphs is attained by a 2‐connected graph G = ( V , E ) $G=(V,E)$. By Petersen's graph theorem, E $E$ is the disjoint union of a 2‐factor and a perfect matching M $M$.
Aya Bernstine, Nati Linial
wiley +1 more source
Side-Contact Representations with Convex Polygons in 3D: New Results for Complete Bipartite Graphs [PDF]
, 2023 André Schulz
openalex +1 more source
Sidorenko's conjecture for blow-ups
Discrete Analysis, 2021 Sidorenko's conjecture for blow-ups, Discrete Analysis 2021:2, 13 pp. Let $G$ be a bipartite graph with finite vertex sets $X$ and $Y$. If $G$ has density $\alpha$, then the average degree of the vertices in $X$ is $\alpha|Y|$, so the mean-square degree
David Conlon, Joonkyung Lee
doaj +1 more source
physica status solidi (b), EarlyView.Density functional theory (DFT) and time‐dependent‐DFT studies reveal that the electronic properties of poly[(2,6‐(4,8‐bis(5‐(2‐hexyl)thiophen‐2‐yl)benzo[1,2‐b:4,5‐b’]dithiophene))‐alt‐(5,5‐(1’,3’‐di‐2‐thienyl‐5’,7’‐bis(2‐ethylhexyl)benzo[1’,2’‐c:4’,5’‐c’]dithiophene‐4,8‐dione)]‐T:3,9‐bis(2‐methylene‐(3‐(1,1‐dicyanomethylene)‐indanone))‐5,5,11,11 ...
Montassar Chaabani +2 more
wiley +1 more source
Total Dominator Total Chromatic Numbers of Wheels, Complete bipartite graphs and Complete graphs [PDF]
, 2022 Adel P. Kazemi, Farshad Kazemnejad
openalex +1 more source
Discussiones Mathematicae Graph Theory, 2021 Let G be either a complete graph of odd order or a complete bipartite graph in which each vertex partition has an even number of vertices. In this paper, we determine the set of triples (p, q, r), with p, q, r > 0, for which there exists a decomposition ...
Shyu Tay-Woei
doaj +1 more source
Entanglement in Quantum Systems Based on Directed Graphs
Advanced Quantum Technologies, EarlyView.The entanglement properties of quantum states associated with directed graphs are investigated. It is proved that the vertex degree distribution fully determines this entanglement measure, which remains invariant under vertex relabeling, thereby highlighting its topological character.
Lucio De Simone, Roberto Franzosi
wiley +1 more source
Strong Domination in Fuzzy Graphs
Fuzzy Information and Engineering, 2015 In this paper, the concept of strong domination number is introduced by using membership values of strong arcs in fuzzy graphs. The strong domination number γs of complete fuzzy graph and complete bipartite fuzzy graph is determined and bounds is ...
O.T. Manjusha, M.S. Sunitha
doaj +1 more source
Journal of Animal Ecology, EarlyView.This study reveals how forest–grassland edges act as ecological barriers that shape tri‐trophic interaction networks. Using multilayer network theory, it uncovers how species influence and biodiversity patterns emerge across spatial layers, offering novel insights into edge‐driven community assembly and conservation in fire‐prone mosaics.
Henrique Negrello‐Oliveira +2 more
wiley +1 more source