A counting polynomial, called Omega Ω(G,x), was proposed by Diudea. It is defined on the ground of
“opposite edge strips” ops. Theta Θ(G,x) and Pi Π(G,x) polynomials can also be calculated by ops
counting. In this paper we compute these counting polynomials for a family of Benzenoid graphs that called
Hexagonal trapezoid system Tb,a.
On Triplet of Positive Integers Such That the Sum of Any Two of Them is a Per...inventionjournals
In this article we discussed determination of distinct positive integers a, b, c such that a + b, a + c, b + c are perfect squares. We can determine infinitely many such triplets. There are such four tuples and from them eliminating any one number we obtain triplets with the specific property. We can also obtain infinitely many such triplets from a single triplet.
Salah satu materi perkuliahan prodi pendidikan matematika mata kuliah teori himpunan dan logika matematika - Diagram Venn, Contoh Soal mengenai Diagram Venn
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
On Triplet of Positive Integers Such That the Sum of Any Two of Them is a Per...inventionjournals
In this article we discussed determination of distinct positive integers a, b, c such that a + b, a + c, b + c are perfect squares. We can determine infinitely many such triplets. There are such four tuples and from them eliminating any one number we obtain triplets with the specific property. We can also obtain infinitely many such triplets from a single triplet.
Salah satu materi perkuliahan prodi pendidikan matematika mata kuliah teori himpunan dan logika matematika - Diagram Venn, Contoh Soal mengenai Diagram Venn
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
B.Sc (Pass) Nautical & Engineering Model Question 2 Mathematics Second Paper
(Differential Calculus, Integral Calculus, Two-dimensional & Three- dimensional Geometry)
II PUC (MATHEMATICS) ANNUAL MODEL QUESTION PAPER FOR ALL SCIENCE STUDENTS WHO...Bagalkot
My dear Students,
Wishing you all happy SHIVRATRI. & ALL THE BEST IN YOUR ANNUAL EXAMS-2014
Here I have uploaded II- P.U.C MATHEMATICS MODEL QUESTION PAPER FOR the year 2014 Which i have designed according to New syllabus of CBSE. I hope this model paper will be helpful to all the students who are writing annual exams on 18-March-2014.
wish you all the best
Regards,
A. NAGARAJ
Director-Faculty
Shree Susheela Tutorials
BAGALKOT-587101
mob: 9845222682
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
B.Sc (Pass) Nautical & Engineering Model Question 2 Mathematics Second Paper
(Differential Calculus, Integral Calculus, Two-dimensional & Three- dimensional Geometry)
II PUC (MATHEMATICS) ANNUAL MODEL QUESTION PAPER FOR ALL SCIENCE STUDENTS WHO...Bagalkot
My dear Students,
Wishing you all happy SHIVRATRI. & ALL THE BEST IN YOUR ANNUAL EXAMS-2014
Here I have uploaded II- P.U.C MATHEMATICS MODEL QUESTION PAPER FOR the year 2014 Which i have designed according to New syllabus of CBSE. I hope this model paper will be helpful to all the students who are writing annual exams on 18-March-2014.
wish you all the best
Regards,
A. NAGARAJ
Director-Faculty
Shree Susheela Tutorials
BAGALKOT-587101
mob: 9845222682
Pushing the limits of ePRTC: 100ns holdover for 100 daysAdtran
At WSTS 2024, Alon Stern explored the topic of parametric holdover and explained how recent research findings can be implemented in real-world PNT networks to achieve 100 nanoseconds of accuracy for up to 100 days.
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
Removing Uninteresting Bytes in Software FuzzingAftab Hussain
Imagine a world where software fuzzing, the process of mutating bytes in test seeds to uncover hidden and erroneous program behaviors, becomes faster and more effective. A lot depends on the initial seeds, which can significantly dictate the trajectory of a fuzzing campaign, particularly in terms of how long it takes to uncover interesting behaviour in your code. We introduce DIAR, a technique designed to speedup fuzzing campaigns by pinpointing and eliminating those uninteresting bytes in the seeds. Picture this: instead of wasting valuable resources on meaningless mutations in large, bloated seeds, DIAR removes the unnecessary bytes, streamlining the entire process.
In this work, we equipped AFL, a popular fuzzer, with DIAR and examined two critical Linux libraries -- Libxml's xmllint, a tool for parsing xml documents, and Binutil's readelf, an essential debugging and security analysis command-line tool used to display detailed information about ELF (Executable and Linkable Format). Our preliminary results show that AFL+DIAR does not only discover new paths more quickly but also achieves higher coverage overall. This work thus showcases how starting with lean and optimized seeds can lead to faster, more comprehensive fuzzing campaigns -- and DIAR helps you find such seeds.
- These are slides of the talk given at IEEE International Conference on Software Testing Verification and Validation Workshop, ICSTW 2022.
Climate Impact of Software Testing at Nordic Testing DaysKari Kakkonen
My slides at Nordic Testing Days 6.6.2024
Climate impact / sustainability of software testing discussed on the talk. ICT and testing must carry their part of global responsibility to help with the climat warming. We can minimize the carbon footprint but we can also have a carbon handprint, a positive impact on the climate. Quality characteristics can be added with sustainability, and then measured continuously. Test environments can be used less, and in smaller scale and on demand. Test techniques can be used in optimizing or minimizing number of tests. Test automation can be used to speed up testing.
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdfPaige Cruz
Monitoring and observability aren’t traditionally found in software curriculums and many of us cobble this knowledge together from whatever vendor or ecosystem we were first introduced to and whatever is a part of your current company’s observability stack.
While the dev and ops silo continues to crumble….many organizations still relegate monitoring & observability as the purview of ops, infra and SRE teams. This is a mistake - achieving a highly observable system requires collaboration up and down the stack.
I, a former op, would like to extend an invitation to all application developers to join the observability party will share these foundational concepts to build on:
Essentials of Automations: The Art of Triggers and Actions in FMESafe Software
In this second installment of our Essentials of Automations webinar series, we’ll explore the landscape of triggers and actions, guiding you through the nuances of authoring and adapting workspaces for seamless automations. Gain an understanding of the full spectrum of triggers and actions available in FME, empowering you to enhance your workspaces for efficient automation.
We’ll kick things off by showcasing the most commonly used event-based triggers, introducing you to various automation workflows like manual triggers, schedules, directory watchers, and more. Plus, see how these elements play out in real scenarios.
Whether you’re tweaking your current setup or building from the ground up, this session will arm you with the tools and insights needed to transform your FME usage into a powerhouse of productivity. Join us to discover effective strategies that simplify complex processes, enhancing your productivity and transforming your data management practices with FME. Let’s turn complexity into clarity and make your workspaces work wonders!
Sudheer Mechineni, Head of Application Frameworks, Standard Chartered Bank
Discover how Standard Chartered Bank harnessed the power of Neo4j to transform complex data access challenges into a dynamic, scalable graph database solution. This keynote will cover their journey from initial adoption to deploying a fully automated, enterprise-grade causal cluster, highlighting key strategies for modelling organisational changes and ensuring robust disaster recovery. Learn how these innovations have not only enhanced Standard Chartered Bank’s data infrastructure but also positioned them as pioneers in the banking sector’s adoption of graph technology.
GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...Neo4j
Leonard Jayamohan, Partner & Generative AI Lead, Deloitte
This keynote will reveal how Deloitte leverages Neo4j’s graph power for groundbreaking digital twin solutions, achieving a staggering 100x performance boost. Discover the essential role knowledge graphs play in successful generative AI implementations. Plus, get an exclusive look at an innovative Neo4j + Generative AI solution Deloitte is developing in-house.
A tale of scale & speed: How the US Navy is enabling software delivery from l...sonjaschweigert1
Rapid and secure feature delivery is a goal across every application team and every branch of the DoD. The Navy’s DevSecOps platform, Party Barge, has achieved:
- Reduction in onboarding time from 5 weeks to 1 day
- Improved developer experience and productivity through actionable findings and reduction of false positives
- Maintenance of superior security standards and inherent policy enforcement with Authorization to Operate (ATO)
Development teams can ship efficiently and ensure applications are cyber ready for Navy Authorizing Officials (AOs). In this webinar, Sigma Defense and Anchore will give attendees a look behind the scenes and demo secure pipeline automation and security artifacts that speed up application ATO and time to production.
We will cover:
- How to remove silos in DevSecOps
- How to build efficient development pipeline roles and component templates
- How to deliver security artifacts that matter for ATO’s (SBOMs, vulnerability reports, and policy evidence)
- How to streamline operations with automated policy checks on container images
Dr. Sean Tan, Head of Data Science, Changi Airport Group
Discover how Changi Airport Group (CAG) leverages graph technologies and generative AI to revolutionize their search capabilities. This session delves into the unique search needs of CAG’s diverse passengers and customers, showcasing how graph data structures enhance the accuracy and relevance of AI-generated search results, mitigating the risk of “hallucinations” and improving the overall customer journey.
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
Epistemic Interaction - tuning interfaces to provide information for AI support
Theta θ(g,x) and pi π(g,x) polynomials of hexagonal trapezoid system tb,a
1. International Journal on Computational Sciences & Applications (IJCSA) Vol.3, No.5, October 2013
THETA Θ(G,X) AND PI Π(G,X)
POLYNOMIALS OF HEXAGONAL
TRAPEZOID SYSTEM TB,A
Mohammad Reza Farahani1
1
Department of Applied Mathematics,
Iran University of Science and Technology (IUST) Narmak, Tehran, Iran
ABSTRACT
A counting polynomial, called Omega Ω(G,x), was proposed by Diudea. It is defined on the ground of
“opposite edge strips” ops. Theta Θ(G,x) and Pi Π(G,x) polynomials can also be calculated by ops
counting. In this paper we compute these counting polynomials for a family of Benzenoid graphs that called
Hexagonal trapezoid system Tb,a.
KEYWORDS
Molecular graph, Benzenoid, Hexagonal trapezoid system, Omega Ω(G,x) polynomial, Theta Θ(G,x)
Polynomial, and Pi Π(G,x) polynomial.
1. INTRODUCTION
Mathematical calculations are absolutely necessary to explore important concepts in chemistry.
Mathematical chemistry is a branch of theoretical chemistry for discussion and prediction of the
molecular structure using mathematical methods without necessarily referring to quantum
mechanics. In chemical graph theory and in mathematical chemistry, a molecular graph or
chemical graph is a representation of the structural formula of a chemical compound in terms of
graph theory.
A topological index is a numerical value associated with chemical constitution purporting for
correlation of chemical structure properties, chemical reactivity or biological activity. Let G(V,E)
be a connected molecular graph without multiple edges and loops, with the vertex set V(G) and
edge set E(G), and vertices/atoms x,y V(G). Two edges/bonds e=uv and f=xy of G are called codistant “e co f”, if and only if they obey the following relation: [1, 2]
d(v,x)=d(v,y)+1=d(u,x)+1=d(u,y)
Relation co is reflexive, that is, e co e holds for any edge e of G; it is also symmetric, if e co f
then f co e and in general, relation co is not transitive. If “co” is also transitive, thus an
equivalence relation, then G is called a co-graph and the set of edges is C(e):={f E(G)| e co f}),
called an orthogonal cut (denoted by oc) of G. In other words, E(G) being the union of disjoint
orthogonal cuts for i≠j & i, j=1, 2, …, k, E G C C2 ... Ck 1 Ck and Ci Cj . Klavžar
1
[3] has shown that relation co is a theta Djoković [4], and Winkler [5] relation. Let m(G,c) be the
DOI:10.5121/ijcsa.2013.3501
1
2. International Journal on Computational Sciences & Applications (IJCSA) Vol.3, No.5, October 2013
number of qoc strips of length c (i.e. the number of cut-off edges) in the graph G. Omega
Polynomial Ω(G,x), [6-9] for counting qoc strips in G was defined by Diudea as
G , x m G , c xc
c
The summation runs up to the maximum length of qoc strips in G. The first derivative (in x=1)
equals the number of edges in the graph
G,1 c m G, c c
Other counting polynomials “Θ(G,x)” and “Π(G,x)“ was defined as
(G, x) m(G, c)c.x c
c
(G, x) m(G, c)c.x
E ( G ) c
c
where m(G,c) is the number of strips of length c. Ω(G,x) and Θ(G,x) polynomials count
“equidistant edges” in G and Π(G,x) “non-equidistant edges”. The first derivative (computed at
x=1) of these counting polynomials provide interesting topological indices:
'(G,1) c m(G, c) c 2
'(G,1) c m(G, c) c( E (G) c)
From above equations, one can see that the first derivative of omega polynomial (in x=1), equals
the number of edges in the graph G, Ω’(G,1)=|E(G)|. And also, the first derivative of Pi
polynomial (in x=1), is equals |E(G)|2-Θ(G,1). In other words, from definition of above counting
polynomials (Omega Ω(G,x), Theta Θ(G,x) and Pi Π(G,x)), one can obtain
'(G,1)2 '(G,1) '(G,1)
The aim of this study is to compute Theta Θ(G,x) and Pi Π(G,x) polynomials of Hexagonal
trapezoid system graphs. Tb,a. Here our notations are standard and mainly taken from [6-26].
2. MAIN RESULTS
In this section by using Cut Method and Orthogonal Cut Method we compute Theta Θ(G,x) and Pi
Π(G,x) polynomials for a family of benzenoid graphs that called Hexagonal trapezoid system Tb,a.
Reader can see general representation of this family in Figure 1 and Reference [27]. A hexagonal
trapezoid system Tb,a (a b ) is a hexagonal system consisting a−b+1 rows of benzenoid chain
in which every row has exactly one hexagon less than the immediate row.
Theorem 2.1. Consider the hexagonal trapezoid system Tb,a (a b ) , Then Theta polynomial of
Tb,a is:
Θ(Tb,a,x)=4x2+6x3+…+2(a-b+1)xa-b+1+(b+1)xb+1+(b+2)xb+2+…+(a-1)xa-1 +axa+(a+1)xa+1 +(6b2b2)xa-b+2
And Theta index of Tb,a is
2
3. International Journal on Computational Sciences & Applications (IJCSA) Vol.3, No.5, October 2013
Θ(Tb,a)=a3+b3-2ab2+ 9 2 a2+ 11 2 b2+2ab + 13 2 a- 9 2 b+5
Figure 1: A general representation of the hexagonal trapezoid system Tb,a (a b )
In general case the number of vertices/atoms and edges/bonds of the hexagonal trapezoid system
2 a 1
3a 1
3
9
b
Tb,a are equal to 2a+1 i 2b1 i =a2−b2+4a+2 and 2a i 3b1 i = (a 2 b2 ) a 1 for all
2
2
2
a b .
From Figures 1 and By using the Cut Method, one can see that there are two types of edges-cut of
hexagonal trapezoid system (we denote the corresponding edges-cut by Ci and Ci) and we have
following table.
Table 2.1. All quasi-orthogonal cuts of hexagonal trapezoid system Tb,a a b .
quasi-orthogonal cuts
The length of qoc strips
The number of qoc strips
Ci i=1,…, a-b
i+1
2
Ca b 1
ci i=1,…,a-b+1
a-b+2
a-i+2
2b
1
Thus, from Table 1, we compute Theta polynomial of hexagonal trapezoid system Tb,a as
Tb,a , x c m Tb,a , c .c.x c
C m Tb,a , Ci .Ci x Ci m Tb,a , Ca b1 .Ca b1x Cab1 c m Tb,a , ci .ci .x ci
i
a b
i
m Tb,a , Ci .Ci x Ci m Tb,a , Ca b 1 .Ca b1x Cab1
i 1
a b 1
m T
i 1
a b
a b 1
i 1
b ,a
, ci .ci .x ci
i 1
2 i 1 x i 1 2ba 4b 2b2 x a b 2
a 2 i x
a 2 i
3
4. International Journal on Computational Sciences & Applications (IJCSA) Vol.3, No.5, October 2013
=4x2+6x3+…+2(a-b+1)xa-b+1+(b+1)xb+1+(b+2)xb+2+…+(a-1)xa-1
+axa+(a+1)xa+1 +(2b+4b-2b2)xa-b+2
a 1 x a 1
a b 1
a 2 ix
i 2
i
x a 2i 2ba 4b 2b 2 x a b 2
Also, Theta index is equal to
a b 1
a b 1
2ix i a 2 i x a 2i 2ba 4b 2b 2 x a b 2
i 1
|
(Tb,a , x) |x1 i 2
x 1
x
a b 1
a b 1
i 2
i 1
2 i2
a b
a 2 i
a b
2
2b a b 2
2
2 i 1 a 1 i a 1 2b a b 2
i 1
2
2
2
2
i 1
a b
3i 2 i 2a 2 a 2 2a 3 a 1 2b a 2 b2 4 2ab 4a 4b
2
i 1
2
3 a b a b
3
2
a b
a 1 a b a b a b a 2 2a 3
2
2
+(a2+2a+1)+(2b3+2a2b-4ab2+8ab-8b2+4)
=(a3-b3-3a2b+3ab2+ 3 2 a2-3ab+ 3 2 b2 + 1 2 a- 1 2 b)-(a3-2a2b+ab2-a2-b2+2ab+a2
-ab-a+b)+(a3-a2b +2a2-2ab +3a-3b) +(a2+2a+1)
+(2b3+2a2b-4ab2+8ab-8b2+4)
=(a3-b3-2a2b+2ab2+ 7 2 a2+ 5 2 b2-6ab+ 9 2 a- 9 2 b)+(a2+2a+1)+(2b3+2a2b
-4ab2+8ab-8b2+4)
=a3+b3-2ab2+ 9 2 a2+ 11 2 b2+2ab + 13 2 a- 9 2 b+5
Theorem 2.2. Pi polynomial Π(Tb,a,x) and Pi index Π(Tb,a) are equal to
Π(Tb,a,x)=4xe-2+6xe-3+…+2(a-b+1)xe+b-a-1+(b+1)xe-b-1+(b+2)xe-b-2+…+(a-1)xe-a+1-1
+axe-a+(a+1)xe-a-1+(6b-2b2)xe+b-a-2 and
4
5. International Journal on Computational Sciences & Applications (IJCSA) Vol.3, No.5, October 2013
Π(Tb,a)= 9 4 a4+ 9 4 b4+ 9 2 a2b2 + 25 2 a3- 5 2 b3 - 23 2 ab2+ 3 2 a2b+ 69 4 a2- 15 4 b2+ 5 2 ab+ 5 2 a+ 11 2 b-4
From Table 2.1 and analogous to Theta polynomial, we have
Tb,a , x c m Tb,a , c .c.x
E (Tb ,a ) c
c m Tb,a , ci .ci .x eci C m Tb,a , Ci .Ci x eCi m Tb,a , Ca b1 .Ca b1x eCab1
i
a b 1
m T
ci ,i 1
i
a b
e ci
m Tb,a , Ci .Ci x eCi m Tb,a , Ca b 1 .Ca b 1x eCab1
b , a , ci .ci .x
Ci ,i 1
a b 1
a b
a 2 i x eia2 2 i 1 x ei1 2ba 4b 2b2 xeba2
i 1
i 1
=4x +6x +…+2(a-b+1)x
e-2
e-3
+(b+1)xe-b-1+(b+2)xe-b-2+…+(a-1)xe-a+1-1
e+b-a-1
+axe-a+(a+1)xe-a-1+(2b+4b-2b2)xe+b-a-2
Clearly, Pi index Π(Tb,a) can be derived from the definition of Pi polynomial Π(Tb,a,x) by
3
9
b
replacing the exponent e (=|E(Tb,a)|) by (a 2 b2 ) a 1 is equal to
2
2
2
2
3
9
b
Π(Tb,a)= (Tb,a , x) |x1 = (a 2 b2 ) a 1 Tb,a
2
2
2
2
= 9 4 a4+ 9 4 b4+ 9 2 a2b2+ 81 4 a2+ b + 27 2 a3- 3 2 b3- 27 2 ab2+ 3 2 a2b+ 3 2 a2+ 3 2 b2
4
+ 9 2 ab+9a+b+1 –(a +b3-2ab2+ 9 2 a2+ 11 2 b2+2ab + 13 2 a- 9 2 b+5)
3
= 9 4 a4+ 9 4 b4+ 9 2 a2b2 + 25 2 a3- 5 2 b3 - 23 2 ab2+ 3 2 a2b + 69 4 a2- 15 4 b2+ 5 2 ab+ 5 2 a+ 11 2 b-4
An especial case of this family is triangular benzenoid Gn, that is equivalent with a hexagonal
trapezoid system T1,n. It is easy to see that the triangular benzenoid Gn n has n2+4n+1
vertices and 3 2 n(n+3) edges (see Figure 2).
Theorem 2.3. Let Gn= T1,n be the triangular benzenoid. Then
Theta polynomial of Gn is equal to Θ(Gn,x)= Θ(T1,n,x)=6x2+9x3+…+3nxn +(n+5)xn+1
Theta index of Gn is equal to Θ(Gn)= Θ(T1,n)=n3+ 9 2 n2+ 13 2 n +7
Pi polynomial of Gn is equal Π(Gn,x)=6xe-2+9xe-3+…+3nxe-n+(n+5)xe-n-1
where e= 3 2 n(n+3)
Pi index of Gn is Π(Gn)= 9 4 n4+ 25 2 n3+ 93 4 n2- 13 2 n- 7 2
5
6. International Journal on Computational Sciences & Applications (IJCSA) Vol.3, No.5, October 2013
Figure 2: Graph of triangular benzenoid G7 or T1,7.
REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[10]
[11]
[12]
[13]
[14]
[15]
[16]
[17]
[18]
[19]
[20]
M.V. Diudea, S. Cigher, A.E. Vizitiu, O. Ursu and P. E. John. Omega polynomial in tubular
nanostructures. Croat. Chem. Acta, 79 (3), 445-448. (2006).
A.E. Vizitiu, S. Cigher, M.V. Diudea and M.S. Florescu, Omega polynomial in ((4,8) 3) tubular
nanostructures. MATCH Commun. Math. Comput. Chem. 57(2), 479-484 (2007).
S. Klavžar, MATCH Commun. Math. Comput. Chem. 59, 217 (2008).
D.Ž. Djoković, J. Combin. Theory Ser. B, 14, 263 (1973).
P.M. Winkler, Discrete Appl. Math. 8, 209 (1984).
M.V. Diudea, Omega polynomial. Carpath. J. Math. 22, (2006) 43–47.
P.E. John, A.E. Vizitiu, S. Cigher, and M.V. Diudea, MATCH Commun. Math. Comput. Chem. 57,
479 (2007).
A.R. Ashrafi, M. Jalali, M. Ghorbani and M.V. Diudea. MATCH, Commun. Math. Comput. Chem.
60 (2008), 905–916
M.V. Diudea and A. Ilić, Note on Omega Polynomial. Carpath. J. Math. 20(1) (2009), 177 – 185.
A.R. Ashrafi, M. Ghorbani and M. Jalali, Ind. J. Chem. 47A, 535 (2008).
M. Ghorbani, A Note On IPR fullerenes. Digest. J. Nanomater. Bios. 6(2), (2011), 599-602
M.V. Diudea and S. Klavžar. Omega Polynomial Revisited. Acta Chim. Slov. 57, (2010), 565–570
M.V. Diudea. Counting Polynomials in Tori T(4,4)S[c,n]. Acta Chim. Slov. 57, (2010), 551–558
M.V. Diudea, S. Cigher, and P.E. John, Omega and related counting polynomials. MATCH Commun.
Math. Comput. Chem. 60, (2008) 237–250.
M.V. Diudea, O. Ursu, and Cs.L. Nagy, TOPOCLUJ, Babes-Bolyai University: Cluj. (2002)
M.R. Farahani, K. Kato and M.P. Vlad. Omega Polynomials and Cluj-Ilmenau Index of
Circumcoronene Series of Benzenoid. Studia Univ. Babes-Bolyai. Chemia 57(3), (2012), 177-182.
M.R. Farahani. Computing Θ(G,x) and Π(G,x) Polynomials of an Infinite Family of Benzenoid. Acta
Chim. Slov. 59, (2012), 965–968.
M.R. Farahani. Omega and Sadhana Polynomials of Circumcoronene Series of Benzenoid. World
Applied Sciences Journal. 20(9), 1248-1251, (2012).
M.R. Farahani. Sadhana Polynomial and its Index of Hexagonal System Ba,b. International Journal of
Computational and Theoretical Chemistry. 1(2), (2013), 7-10.
M.R. Farahani. Counting Polynomials of Benzenoid Systems. Proceedings of the Romanian Academy
Series B Chemistry 15(3). (2013). In press.
6
7. International Journal on Computational Sciences & Applications (IJCSA) Vol.3, No.5, October 2013
[21] M.R. Farahani. Omega and related counting polynomials of Triangular Benzenoid Gn and linear
hexagonal chain LHn. Journal of Chemica Acta, 2, (2013), 43-45.
[22] M.R. Farahani. Omega Polynomial of a Benzenoid System. Submitted for publication. (2013).
[23] M.R. Farahani. Computing Omega and Sadhana Polynomials of Hexagonal trapezoid system Tb,a.
Submitted for publication. (2013).
[24] M. Ghorbani, M. Ghazi. Computing Omega and PI polynomials of Graphs. Digest. J. Nanomater.
Bios. 5(4), 2010, 843-849
[25] N. Trinajstić, Chemical Graph Theory, CRC Press, Boca Raton, FL, 1992.
[26] H. Wiener, Structural determination of the paraffin boiling points. J. Am. Chem. Soc. 69, (1947) 17–
20.
[27] Z. Bagheri, A. Mahmiani and O. Khormali. Iranian Journal of Mathematical Sciences and
Informatics. 3(1), (2008), 31-39.
7