On the super connectivity of direct product of graphs
F Soliemany, M Ghasemi, R Varmazyar - RAIRO-Operations Research, 2022 - rairo-ro.org
A vertex-cut S is called a super vertex-cut if G− S is disconnected and it contains no isolated
vertices. The super-connectivity, κ′, is the minimum cardinality over all super vertex-cuts …
vertices. The super-connectivity, κ′, is the minimum cardinality over all super vertex-cuts …
On k-regular edge connectivity of chemical graphs
Quantitative structure property research works, which are the essential part in chemical
information and modelling, give basic underlying topological properties for chemical …
information and modelling, give basic underlying topological properties for chemical …
Under which conditions is λ″(G)=κ″(L(G))?
F Soliemany, M Ghasemi… - AKCE International Journal …, 2023 - Taylor & Francis
Full article: Under which conditions is λ″(G)=κ″(L(G))? Skip to Main Content Taylor and
Francis Online homepage Browse Search Publish Login | Register Log in or Register Login …
Francis Online homepage Browse Search Publish Login | Register Log in or Register Login …
On -restricted connectivity of direct product of graphs
H Cheng, R Varmazyar, M Ghasemi - … Mathematics, Algorithms and …, 2023 - World Scientific
Let G be a graph. A vertex-cut S of G is said to be k-restricted if every component of G− S has
at least k vertices, and cyclic if G− S has at least two components which contain a cycle. The …
at least k vertices, and cyclic if G− S has at least two components which contain a cycle. The …
[PDF][PDF] SOME RESULTS ON DIRECT PRODUCT GRAPHS
Z Ghasemi - i4c.iust.ac.ir
SOME RESULTS ON DIRECT PRODUCT GRAPHS 1 Introduction Page 1 SOME RESULTS
ON DIRECT PRODUCT GRAPHS Zeinab Ghasemi1 Department of Mathematics, Khoy …
ON DIRECT PRODUCT GRAPHS Zeinab Ghasemi1 Department of Mathematics, Khoy …